leetcode 110. Balanced Binary Tree

最新推荐文章于 2025-11-29 22:00:00 发布

转载最新推荐文章于 2025-11-29 22:00:00 发布 · 362 阅读

文章标签：

#leetcode

Leetcode 专栏收录该内容

48 篇文章

订阅专栏

本文介绍了一种判断二叉树是否为高度平衡的方法。通过递归计算每个节点左右子树的最大深度，并确保任意节点左右子树深度之差不超过1来实现。文章提供了完整的Java代码实现。

题目

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) {
        if(root==null)
            return true;

        if(Math.abs(maxDepth(root.left)- maxDepth(root.right))>1){
            return false;
        }

        return isBalanced(root.left)&&isBalanced(root.right);                       
    }

    public  int maxDepth(TreeNode root){
        if(root==null) 
            return 0;


        return Math.max(maxDepth(root.left), maxDepth(root.right))+1;
    }
}