【Leetcode-Easy-110】Balanced Binary Tree

最新推荐文章于 2024-09-07 14:15:01 发布

原创最新推荐文章于 2024-09-07 14:15:01 发布 · 782 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 同时被 2 个专栏收录

50 篇文章

订阅专栏

LeetCode

50 篇文章

订阅专栏

本文介绍了一种通过递归方式判断二叉树是否为高度平衡的方法。高度平衡的二叉树定义为对于任意节点，其两个子树的深度之差不超过1。文中提供了一个Java实现示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

【Leetcode-Easy-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.

思路

递归
二叉树的深度

程序

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

        int l = depth(root.left);
        int r = depth(root.right);

        if (Math.abs(l-r) > 1) return false;
        return isBalanced(root.left) && isBalanced(root.right);
    }

    private int depth(TreeNode root){
        if (root == null) return 0;
        int l = depth(root.left);
        int r = depth(root.right);
        return Math.max(l, r) + 1;
    }
}