Balanced Binary Tree

最新推荐文章于 2023-04-13 15:01:12 发布

iteye_6755

最新推荐文章于 2023-04-13 15:01:12 发布

阅读量47

点赞数

分类专栏： leetcode

leetcode 专栏收录该内容

193 篇文章

订阅专栏

本文探讨了如何通过递归方法判断给定的二叉树是否为高度平衡的二叉树，即每个节点的左右子树深度之差不超过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 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; }
 * }
 */
public class Solution {
    public boolean isBalanced(TreeNode root) {
    	if (solve(root) == -1) {
    		return false;
    	}
    	return true;
    }

	private int solve(TreeNode root) {
		if (root == null) {
			return 0;
		}
		int left = solve(root.left);
		if (left == -1) {
			return -1;
		}
		int right = solve(root.right);
		if (right == -1) {
			return -1;
		}
		if (Math.abs(left-right) > 1) {
			return -1;
		} else {
			return Math.max(left, right)+1;
		}
	}
}