【LeetCode】101. Symmetric Tree

101. Symmetric Tree

Description：
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
**Note:**Bonus points if you could solve it both recursively and iteratively.
Difficulty：Easy
Example:

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

    1
   / \
  2   2
 / \ / \
3  4 4  3

方法1: Recursive

• Time complexity : $O\left(n\right)$
• Space complexity : $O\left(n\right)$
  思路：
  对称树可以想象中间有个镜子，需要满足left->left == right->right和left->right == right->left

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

方法2: 迭代，queue

• Time complexity : $O\left(n\right)$
• Space complexity : $O\left(n\right)$

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