leetcode-101 Symmetric Tree

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

递归比较即可。

/**
 * 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;
        return isSame(root->left,root->right);
    }
    bool isSame(TreeNode* node1, TreeNode* node2){
        if(!node1&&!node2)
            return true;
        else if(!node1||!node2)
            return false;
        if(node1->val == node2->val)
            return isSame(node1->left,node2->right)&&isSame(node1->right,node2->left);
        else 
            return false;
    }
};