题解 | #判断是不是平衡二叉树#【js 实现】
判断是不是平衡二叉树
https://www.nowcoder.com/practice/8b3b95850edb4115918ecebdf1b4d222
/* function TreeNode(x) {
this.val = x;
this.left = null;
this.right = null;
} */
function IsBalanced_Solution(pRoot)
{
// write code here
if(pRoot === null) return true
const left = getTreeDepth(pRoot.left)
const right = getTreeDepth(pRoot.right)
if(Math.abs(left - right) > 1) {
return false
}
const leftTree = IsBalanced_Solution(pRoot.left)
const rightTree = IsBalanced_Solution(pRoot.right)
return leftTree && rightTree
}
function getTreeDepth(root) {
if(root === null) return 0
const left = getTreeDepth(root.left)
const right = getTreeDepth(root.right)
return Math.max(left, right) + 1
}
module.exports = {
IsBalanced_Solution : IsBalanced_Solution
};
