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

解析：递归进行，left->left==right->right
left->right==right->left

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

    }
};