/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
bool judge(TreeNode *left,TreeNode *right){
if(left==NULL&right==NULL)return true;
if(left!=NULL&&right!=NULL){
if(left->val==right->val)
return judge(left->left,right->right)&&judge(left->right,right->left);
}
return false;
}
public:
bool isSymmetric(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(root==NULL)return true;
return judge(root->left,root->right);
}
};