LeetCode 110.Balanced Binary Tree

最新推荐文章于 2023-11-11 23:37:07 发布

qq_34344061

最新推荐文章于 2023-11-11 23:37:07 发布

阅读量194

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签：平衡二叉树最大高度

本文链接：https://blog.youkuaiyun.com/qq_34344061/article/details/79187106

leetcode 专栏收录该内容

40 篇文章

订阅专栏

本文介绍了一种基于最大高度的算法来判断一棵二叉树是否为高度平衡的二叉树。通过递归计算每个节点的左右子树深度，并确保深度差不超过1，实现了高效的平衡性检查。

LeetCode 110.Balanced Binary Tree

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.

Example 1:

Given the following tree [3,9,20,null,null,15,7]:

Return true.
Example 2:

Given the following tree [1,2,2,3,3,null,null,4,4]:

Return false.

public boolean isBalanced(TreeNode root) {
        if(root==null)
            return true;
        if(Math.abs(Depth(root.left)-Depth(root.right))<=1){
            return isBalanced(root.left)&&isBalanced(root.right);
        }
         return false;
    }
    public int Depth(TreeNode p){
        if(p==null)
            return 0;
        int leftdepth=Depth(p.left)+1;
        int rightdepth=Depth(p.right)+1;
        return leftdepth>rightdepth?leftdepth:rightdepth;
    }
    //思路：基于二叉树的最大高度解决此题；