Balanced Binary Tree

最新推荐文章于 2025-05-07 23:04:41 发布

dihu6677

最新推荐文章于 2025-05-07 23:04:41 发布

阅读量103

点赞数

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/GodBug/p/7392502.html

版权

本文介绍了一种算法，用于判断二叉树是否为高度平衡的。高度平衡的二叉树定义为对于每个节点，其两个子树的深度之差不超过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; }
 * }
 */
class Solution {
    public boolean isBalanced(TreeNode node) {
        if(node == null){
            return true;
        }

        int leftDeepth = calDeepth(node.left);
        int rightDeepth = calDeepth(node.right);

        if(Math.abs(leftDeepth-rightDeepth)>1){
            return false;
        }

        return isBalanced(node.left)&&isBalanced(node.right);
    }
    
    // 获取二叉树的深度
    private int calDeepth(TreeNode node){
        if(node==null){
            return 0;
        }
        int leftDeepth = calDeepth(node.left);
        int rightDeepth = calDeepth(node.right);

        return 1+(leftDeepth > rightDeepth ? leftDeepth : rightDeepth);
    }
    
}

转载于:https://www.cnblogs.com/GodBug/p/7392502.html