LeetCode@Tree_110_Balanced_Binary_Tree

最新推荐文章于 2019-02-24 12:02:19 发布

原创最新推荐文章于 2019-02-24 12:02:19 发布 · 189 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 专栏收录该内容

39 篇文章

订阅专栏

本文介绍了一种判断二叉树是否为高度平衡的方法。高度平衡的二叉树定义为对于每个节点，其两个子树的深度之差不超过1。文章提供了一个Java实现的例子，包括计算树的最大深度。

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

110. Balanced Binary Tree

Description Hints Submissions Solutions

Total Accepted: 172600
Total Submissions: 465133
Difficulty: Easy
Contributor: LeetCode

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.

Subscribe to see which companies asked this question.

Hide Tags

Tree Depth-first Search

Hide Similar Problems

java:

/**
 * 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;
		}
		else
		{
			return Math.abs(maxDepth(root.right) - maxDepth(root.left))<=1 
					&& isBalanced(root.right)
					&& isBalanced(root.left);
		}
	}

	public int maxDepth(TreeNode root)
	{
		int h = 0;
		if (root == null)
		{
			return h;
		}
		else
		{
			return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
		}

	}
}