110. Balanced Binary Tree

最新推荐文章于 2022-07-18 20:53:17 发布

原创最新推荐文章于 2022-07-18 20:53:17 发布 · 437 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

32 篇文章

订阅专栏

本文介绍了一种用于判断二叉树是否为高度平衡的方法。高度平衡二叉树定义为对于树中每一个节点，其两个子树的深度相差不超过1。文章通过递归方式实现了该算法，并提供了完整的Java代码实现。

摘要生成于 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) {
        if(root==null) {
            return true;
        }
        if(!(Math.abs(maxDepth(root.left) - maxDepth(root.right)) < 2)){
            return false;
        }
        
        boolean left = isBalanced(root.left);
        boolean right = isBalanced(root.right);
        
        return left&&right;
    }
    
    public int maxDepth(TreeNode root){
        
        if(root == null){
            
            return 0;
            
        }
        
        int l = maxDepth(root.left);
        int r = maxDepth(root.right);
        
        return l > r ? l + 1 : r + 1;
        
    }
}