CODE 23: Balanced Binary Tree

最新推荐文章于 2024-09-03 15:28:22 发布

原创最新推荐文章于 2024-09-03 15:28:22 发布 · 691 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

154 篇文章

订阅专栏

本文介绍了一种算法，用于确定给定的二叉树是否为高度平衡的二叉树。高度平衡的定义是：对于树中每一个节点，其两个子树的深度之差不超过1。通过递归的方法检查每个节点的左右子树深度，实现了这一功能。

摘要生成于 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 ofevery node never differ by more than 1.

	public boolean isBalanced(TreeNode root) {
		// Start typing your Java solution below
		// DO NOT write main() function
		if (null == root) {
			return true;
		}
		return checkBalanced(root) != -1;
	}

	public int checkBalanced(TreeNode root) {
		if (null == root) {
			return 0;
		}
		int left = checkBalanced(root.left);
		int right = checkBalanced(root.right);

		if (left == -1 || right == -1) {
			return -1;
		}
		if (Math.abs(left - right) > 1) {
			return -1;
		} else {
			return Math.max(left, right) + 1;
		}
	}