题解 | #判断是不是平衡二叉树#C++判定平衡二叉树

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 *	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param pRoot TreeNode类 
     * @return bool布尔型
     */
    int height(TreeNode*root)
    {
        if(root)
        {
            int m=height(root->left);
            int n=height(root->right);
            return max(m,n)+1;
        }
        return 0;
    }
    bool answer(TreeNode*root)
    {
        if(root)
        {
            int m=height(root->left);
            int n=height(root->right);
            return abs(m-n)<=1  &&  answer(root->left)  &&  answer(root->right);
        }
        return 1;
    }
    bool IsBalanced_Solution(TreeNode* pRoot) 
    {
        return answer(pRoot);
    }
};