剑指offer-刷题笔记-简单题-JZ79 判断是不是平衡二叉树

剑指offer-刷题笔记-简单题-JZ79 判断是不是平衡二叉树

class Solution {
public:
    
    //获取二叉树深度
    int GetTreeDepth(TreeNode* pRoot)
    {
        int depth = 0;
        if(pRoot == nullptr)
        {
            depth = 0;
        }else{
        //左右子树最大深度+1
            depth = max(GetTreeDepth(pRoot->left),GetTreeDepth(pRoot->right))+1;
        }
        return depth;
    }
    
    bool IsBalanced_Solution(TreeNode* pRoot) {
        //空树
        if(pRoot == nullptr || pRoot->left == nullptr && pRoot->right == nullptr)
        {
           return true;
        }
        else if (abs(GetTreeDepth(pRoot->left)- GetTreeDepth(pRoot->right)) > 1)
        {
            return false;
        }
        
        //判断左右子树是否为平衡二叉树
        return IsBalanced_Solution(pRoot->left) && IsBalanced_Solution(pRoot->right);
    }
};