Leetcode-101-Symmetric tree

Description

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

Example

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

Thoughts

两种实现：递归和迭代。

1. 递归比较好实现，我们只需要对对称的两个节点进行验证其值是否相同，往其左右子树递归即可。
2. 迭代的话，创建一个队列，将根节点压入两次。只要队列不为空，弹出两个节点，验证其值是否相等。相等的话压入前者左子树后者右子树，前者右子树后者左子树，迭代。

Code

1. 递归

/**
 * 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 check(TreeNode* p, TreeNode* q) {
        if (!p && !q)
            return true;
        if (!p || !q)
            return false;
        return (p -> val == q -> val) && check(p -> left, q -> right) && check(p -> right, q -> left);
    }
    bool isSymmetric(TreeNode* root) {
        return check(root, root);
    }
};

2. 迭代

/**
 * 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)
            return true;
        queue<TreeNode*> q;
        q.push(root);
        q.push(root);
        TreeNode* u;
        TreeNode* v;
        while (!q.empty()) {
            u = q.front();q.pop();
            v = q.front();q.pop();
            if (!u && !v)
                continue;
            if (!u || !v)
                return false;
            if (u -> val != v -> val)
                return false;
            q.push(u -> left);
            q.push(v -> right);
            q.push(u -> right);
            q.push(v -> left);
        }
        return true;
    }
};