[Leetcode] 110. Balanced Binary Tree

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

原创最新推荐文章于 2023-11-11 23:37:07 发布 · 349 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Leetcode #Tree #Depth-first Search

Leetcode 专栏收录该内容

143 篇文章

订阅专栏

本文介绍了一种算法，用于确定二叉树是否为高度平衡的。高度平衡的二叉树定义为对于每个节点，其两个子树的深度之差不超过1。通过递归计算每个节点的深度来实现这一目标。

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 binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean isBalanced(TreeNode root) {
        return getHeight(root) != -1;
    }
    private int getHeight(TreeNode root){
        if(root == null) return 0;
        int left = getHeight(root.left);
        int right = getHeight(root.right);
        if(left == -1 || right == -1 || Math.abs(left - right) > 1) return -1;
        return Math.max(left, right) + 1;
    }
}