Leetcode 110. Balanced Binary Tree

zhangwj0101

于 2016-03-28 21:42:05 发布

阅读量260

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.youkuaiyun.com/zhangwj0101/article/details/51001509

Leetcode 专栏收录该内容

51 篇文章

订阅专栏

本文介绍了一种用于判断二叉树是否为高度平衡的方法。通过递归计算每个节点的左右子树深度，并确保任意节点的左右子树深度之差不超过1来实现。平衡二叉树的定义及其实现细节在文中均有详述。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Question

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.

Code

 public int get(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int ldep = get(root.left);
        if (ldep == -1) {
            return -1;
        }
        int rdep = get(root.right);
        if (rdep == -1) {
            return -1;
        }
        if (Math.abs(ldep - rdep) >= 2) {
            return -1;
        }
        return Math.max(rdep + 1, ldep + 1);

    }

    public boolean isBalanced(TreeNode root) {

        int result = get(root);
        return result != -1;
    }