Balanced Binary Tree

最新推荐文章于 2023-04-13 15:01:12 发布

原创最新推荐文章于 2023-04-13 15:01:12 发布 · 145 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Tree #DFS #Javascript #Leetcode #Easy

Leetcode Easy Javascript 专栏收录该内容

71 篇文章

订阅专栏

本文介绍了一种判断二叉树是否为高度平衡的方法。高度平衡的二叉树定义为对于每个节点，其左右子树的深度之差不超过1。通过递归地计算每个节点的最大高度并比较来实现。

Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Tags

Tree, DFS

----------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Check height of the left and right tree difference.

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @return {boolean}
 */

function maxHeight(node) {
    if (node === null) {
        return 0;
    }

    if (node.left === null && node.right === null) {
        return 1;
    }

    return Math.max(maxHeight(node.left), maxHeight(node.right)) + 1;
}

var isBalanced = function (root) {
    if (root === null || (root.left === null && root.right === null)) {
        return true;
    }

    return (Math.abs(maxHeight(root.left) - maxHeight(root.right)) <= 1) && isBalanced(root.left) && isBalanced(root.right);
};