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

/* function TreeNode(x) {
    this.val = x;
    this.left = null;
    this.right = null;
} */
// 用来标识
var flag = true;
//先求深度
function deep(root){
    if(root == null){
        return 0;
    }
    let left = deep(root.left);
    let right = deep(root.right);
    if(Math.abs(left-right) > 1){
        flag = false;
    }
    return Math.max(left,right) + 1;
}
function IsBalanced_Solution(pRoot)
{
    // write code here
    if(pRoot == null){
        return true;
    }
    // let left = IsBalanced_Solution(pRoot.left);
    // let right = IsBalanced_Solution(pRoot.right);
    // if(Math.abs(left-right) > 1){
    //     return false;
    // }
    deep(pRoot);
    return flag;
}
module.exports = {
    IsBalanced_Solution : IsBalanced_Solution
};