LeetCode 101. 对称二叉树

class Solution {
public:
    bool equal(TreeNode* left,TreeNode* right){
        if(left==NULL&&right==NULL)
            return true;
        else if(left==NULL||right==NULL)
            return false;
        return (equal(left->left,right->right)&&equal(left->right,right->left)&&(left->val==right->val));//递归子树
    }
    bool isSymmetric(TreeNode* root) {
        if(root==NULL)
            return true;
        return equal(root->left,root->right);
    }
};