28.对称的二叉树 (Easy)*

class Solution {
public:
    bool isSymmetric(TreeNode* root) {
        if(root == nullptr) {
            return true;
        }
        return helper(root->left, root->right);
    }
    bool helper(TreeNode *left, TreeNode *right) {
        if(left == nullptr && right != nullptr || left != nullptr && right == nullptr) {
            return false;
        }
        if(left != nullptr && right != nullptr) {
            if(left->val != right->val) {
                return false;
            }
            return helper(left->left, right->right) && helper(left->right, right->left);
        }
        return true;
    }
};

class Solution {
public:
    bool isSymmetric(TreeNode* root) {
        if(root == nullptr) {
            return true;
        }
        stack<TreeNode*> lStack;
        stack<TreeNode*> rStack;
        TreeNode *curLeft = root->left;
        TreeNode *curRight = root->right;
        while(curLeft != nullptr || !lStack.empty() || curRight != nullptr || !rStack.empty()) {
            while(curLeft != nullptr) {
                lStack.push(curLeft);
                curLeft = curLeft->left;
            }
            while(curRight != nullptr) {
                rStack.push(curRight);
                curRight = curRight->right;
            }
            if(lStack.size() != rStack.size()) {
                return false;
            }
            curLeft = lStack.top();
            lStack.pop();
            curRight = rStack.top();
            rStack.pop();
            if(curRight->val != curLeft->val) {
                return false;
            }
            curLeft = curLeft->right;
            curRight = curRight->left;
        }
        return true;
    }
};

class Solution {
public:
    bool isSymmetric(TreeNode* root) {
        if(root == nullptr) {
            return true;
        }
        queue<TreeNode*> helpQueue;
        helpQueue.push(root);
        helpQueue.push(root);
        TreeNode *cur1 = root, *cur2 = root;
        while(!helpQueue.empty()) {
            cur1 = helpQueue.front();
            helpQueue.pop();
            cur2 = helpQueue.front();
            helpQueue.pop();
            if(cur1 == nullptr && cur2 == nullptr) {
                continue;
            }
            if(cur1 == nullptr || cur2 == nullptr) {
                return false;
            }
            if(cur1->val != cur2->val) {
                return false;
            }else {
                helpQueue.push(cur1->left);
                helpQueue.push(cur2->right);
                helpQueue.push(cur1->right);
                helpQueue.push(cur2->left);
            }
        }
        return true;
    }
};