LeetCode101. Symmetric Tree（C++）

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

 

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

解题思路：递归遍历，假设左右子树均不为空的情况下，需要判断左子树的左子树与右子树的右子树是否相同，左子树的右子树与右子树的左子树是否相同。

/**
 * 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==NULL||(root->left==NULL&&root->right==NULL))
            return true;
        if(root->left!=NULL&&root->right!=NULL)
            return (root->left->val==root->right->val ? true : false)&&travel(root->left,root->right);
        if(root->left==NULL||root->right==NULL)
            return false;
    }
    bool travel(TreeNode* rl,TreeNode* rr){
        if(rl==NULL&&rr==NULL)
            return true;
        if(rl==NULL||rr==NULL)
            return false;
        if(rl->val!=rr->val)
            return false;
        return travel(rl->left,rr->right)&&travel(rl->right,rr->left);
    }
};