剑指offer-刷题笔记-简单题-JZ28 对称的二叉树

剑指offer-刷题笔记-简单题-JZ28 对称的二叉树

版本1-自己写的很复杂

/*
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) {
        // write code here
        //TreeNode* result;
        //result = pRoot;
        if(pRoot == nullptr)
        {
            return pRoot;
        }
        else{
            TreeNode* temp;
            temp = pRoot->left;
            pRoot->left = pRoot->right; 
            pRoot->right = temp;           
            pRoot->left = Mirror(pRoot->left);
            pRoot->right = Mirror(pRoot->right);
        }
        return pRoot;
    }
    
    void CopyBiTree(TreeNode* root, TreeNode* newroot) //复制二叉树
    {
        if (root == nullptr)
            return;
        else
        {
            newroot->val = root->val;
            if (root->left != nullptr)
                newroot->left = new TreeNode(0);
            if (root->right != nullptr)
                newroot->right = new TreeNode(0);

            CopyBiTree(root->left, newroot->left);
            CopyBiTree(root->right, newroot->right);
        }
    }
    bool isSameTree(TreeNode* p,TreeNode* q)//判断
    {
        //两棵二叉树均为null
        if(p == nullptr && q == nullptr){
            return true;
        }
        //其中只有一棵树为null
        if(p == nullptr || q == nullptr){
            return false;
        }
        //节点值不相等
        if(p->val != q->val){
            return false;
        }
        //两棵树不为null,且节点值相等，分别比较该节点的左子树、右子树
        return isSameTree(p->left,q->left) && isSameTree(p->right,q->right);
     }

    bool isSymmetrical(TreeNode* pRoot) {
        TreeNode* prepRoot = new TreeNode(0) ;
        CopyBiTree(pRoot, prepRoot);
        TreeNode* MirrorpRoot = Mirror(pRoot);
        if(pRoot == nullptr|| (pRoot->left == nullptr)&&(pRoot->right == nullptr))
        {
            return true;
        }
        
        if(isSameTree(MirrorpRoot,prepRoot))
        {
            return true;
        }else{
            return false;
        }
    }

};

版本2 - 递归

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};
*/
class Solution {
public:
    //对比左右子树
    bool compare(TreeNode* left,TreeNode* right)
    {
        if((left == nullptr && right == nullptr))
        {
            return true;
        }else if(left == nullptr || right == nullptr || left->val != right->val)
        {
            return false;
        }else{
        	//关键
            return compare(left->left,right->right)&& compare(left->right,right->left);
        }
    }
    
    bool isSymmetrical(TreeNode* pRoot) {
        //对称条件
        if(pRoot == nullptr)
        {
            return true;
        }else{
            return compare(pRoot->left,pRoot->right);
        }
       
    }

};