leetcode：Balanced Binary Tree 【Java】

最新推荐文章于 2021-05-11 11:45:04 发布

原创最新推荐文章于 2021-05-11 11:45:04 发布 · 319 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

leetcode 专栏收录该内容

79 篇文章

订阅专栏

本文阐述了如何通过计算二叉树的高度来判断其是否为平衡二叉树，重点介绍了算法实现过程及关键代码。

摘要生成于 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 a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean isBalanced(TreeNode root) {
        return balancedHeight(root) >= 0;
    }
    
    public int balancedHeight(TreeNode root){
        if(root == null){
            return 0;
        }
        
        int left = balancedHeight(root.left);
        int right = balancedHeight(root.right);
        
        if(left < 0 || right < 0 || Math.abs(left - right) > 1){
            return -1;
        }
        
        return Math.max(left, right) + 1;
    }
}