leetcode【101】Symmetric Tree

问题描述：

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

源码：

和第100题有点像leetcode【1-100】总结。和剑指offer的第28题剑指offer总纲是一样的。先看看递归的方法。思路就很简单了，左右对比就行了。时间在78%，空间在100%。

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

再来看看非递归的方法，还是和第100题很像，效率也是一样：

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