剑指offer JZ28 对称的二叉树 递归

原题链接：剑指offer JZ28 对称的二叉树

递归将二叉树镜像翻转，递归判断两个树是否对称。

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};
*/
class Solution {
public:
    TreeNode* Mirror(TreeNode* pRoot) {
        if(!pRoot)
            return pRoot;
        TreeNode* tmp=pRoot->left;
        pRoot->left=pRoot->right;
        pRoot->right=tmp;
        Mirror(pRoot->left);
        Mirror(pRoot->right);
        return pRoot;
    }
    bool issame(TreeNode* pRoot1,TreeNode* pRoot2)
    {
        if(!pRoot1 && !pRoot2)
            return true;
        if(!pRoot1 || !pRoot2)
            return false;
        return pRoot1->val==pRoot2->val && issame(pRoot1->left, pRoot2->right) && issame(pRoot1->right, pRoot2->left);
    }
    bool isSymmetrical(TreeNode* pRoot) {
          if(!pRoot)
              return true;
          TreeNode* p=Mirror(pRoot) ;
          return issame(p,pRoot);
        
    }

};