leetcode Symmetric Tree

Description:

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree [1,2,2,3,4,4,3] is symmetric:

    1

   / \

  2   2

 / \ / \

3  4 4  3

But the following [1,2,2,null,3,null,3] is not:

    1

   / \

  2   2

   \   \

   3    3

Note:
Bonus points if you could solve it both recursively and iteratively.

1.递归方式 

复杂度O（n)。

//6 ms
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isSymmetric(TreeNode* root) {
        return isMirror(root, root);
    }
    
     bool isMirror(TreeNode* tree1, TreeNode* tree2) {
         if (tree1 == nullptr || tree2 ==nullptr) return tree1 == tree2;
         if (tree1->val != tree2->val) return false;
         return isMirror(tree1->left, tree2->right) && isMirror(tree1->right, tree2->left);
     }
};

2.迭代方式

复杂度O（n)。

//3 ms
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isSymmetric(TreeNode* root) {
        if (root == nullptr) return true;
        TreeNode *tree1, *tree2;
        queue<TreeNode*> que1, que2;
        que1.push(root->left);
        que2.push(root->right);
        while (!que1.empty() && !que2.empty()) {
            tree1 = que1.front();
            que1.pop();
            tree2 = que2.front();
            que2.pop();
            if (tree1 == nullptr && tree2 ==nullptr) continue;
            if (tree1 == nullptr || tree2 ==nullptr) return false;
            if (tree1->val != tree2->val) return false;
            que1.push(tree1->left);
            que1.push(tree1->right);
            que2.push(tree2->right);
            que2.push(tree2->left);
        }
        return true;
        
    }
};