LeetCode-balanced-binary-tree

最新推荐文章于 2019-07-29 17:51:00 发布

六月二十七

最新推荐文章于 2019-07-29 17:51:00 发布

阅读量242

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： balanced-binary-tree LeetCode

本文链接：https://blog.youkuaiyun.com/weixin_42146769/article/details/88980213

LeetCode 专栏收录该内容

105 篇文章

订阅专栏

本文介绍了一种算法，用于判断一棵二叉树是否为高度平衡的二叉树。高度平衡二叉树定义为对于每一个节点，其左右子树的深度之差不超过1。通过递归计算每个节点的深度，并检查其平衡状态。

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

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.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    boolean flag = false;
    public boolean isBalanced(TreeNode root) {
        getDepth(root);
        return !flag;
    }
     
    public int getDepth(TreeNode root) {
        if(flag || root == null) {
            return 0;
        }
        int left = getDepth(root.left);
        int right = getDepth(root.right);
        if(Math.max(left, right) - Math.min(left, right) > 1) {
            flag = true;
        }
        return 1 + Math.max(left, right);
    }
}