LeetCode || Symmetric Tree

Symmetric Tree

题目链接  耗时：4ms.

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

For example, this binary tree is symmetric:

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

But the following is not:

    1
   / \
  2   2
   \   \
   3    3

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

/**
 * 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 Equal(TreeNode* t1, TreeNode* t2)
    {
        if(t1 == NULL && t2 == NULL)
            return true;
        if(t1!=NULL && t2 == NULL)
            return false;
        if(t2 != NULL && t1 == NULL)
            return false;
        
        if(t1->val == t2->val)
        {
            //注意：事实上是判断t1的左节点与t2的右节点相等。
            return (Equal(t1->left, t2->right) && Equal(t1->right, t2->left));
        }
        
        return false;
    }
    
    bool isSymmetric(TreeNode* root) {
        if(root == NULL || (root->left == NULL && root->right == NULL))
            return true;
        
        return Equal(root->left, root->right);
    }
};