leetcode 110 Balanced Binary Tree

原创于 2016-06-07 23:07:02 发布 · 236 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

127 篇文章

订阅专栏

本文介绍了一种用于判断二叉树是否为高度平衡的方法。高度平衡二叉树定义为对于树中每一个节点，其两个子树的深度相差不超过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.

Subscribe to see which companies asked this question

class Solution {
public:
	int balanced(TreeNode *root) {
		if(root==NULL) {
			return 0;
		}


		int left = balanced(root->left);
		if(left==-1) return -1;

		int right = balanced(root->right);
		if(right==-1) return -1;

		if(abs(left-right) > 1) return -1;
		return max(left, right)+1;
	}
	bool isBalanced(TreeNode *root) {
		if(root == NULL) return true;

		int h = balanced(root);

		return h!=-1;
	}
}