对称的二叉树

 

class Solution {
public:
    bool isSame(TreeNode* p1, TreeNode* p2)
    {
        if(!p1 && !p2)
            return true;
        if(!p1 || !p2)
            return false;
        if(p1->val == p2->val)
            return isSame(p1->left,p2->right) && isSame(p1->right,p2->left);
        else return false;
    }
    bool isSymmetrical(TreeNode* pRoot)
    {
       if(pRoot == NULL)
           return true;
        return isSame(pRoot,pRoot);
    }

};