题解 | #判断是不是平衡二叉树# | 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布尔型
     */
    bool IsBalanced_Solution(TreeNode* pRoot) {
        if (pRoot == nullptr) return true;
        return IsBalanced_Solution(pRoot->left) && IsBalanced_Solution(pRoot->right)&&std::abs(height(pRoot->left) - height(pRoot->right)) <=1;
    }
    int height(TreeNode* node) {
        return node == nullptr? 0 : 1+std::max(height(node->left),height(node->right));
    }
};