leetcode_question_110 Balanced Binary Tree

最新推荐文章于 2025-08-11 15:06:51 发布

原创最新推荐文章于 2025-08-11 15:06:51 发布 · 1.2k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #Balanced Binary Tree #Recurse

程序员笔试面试同时被 3 个专栏收录

223 篇文章

订阅专栏

算法与数据结构

223 篇文章

订阅专栏

Leetcode

179 篇文章

订阅专栏

本文介绍了一种通过递归方式判断二叉树是否为高度平衡的算法。高度平衡二叉树定义为对于每一个节点，其左右子树的深度相差不超过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 everynode never differ by more than 1.

Recursive:

bool balance(TreeNode* root, int &depth)
    {
    	if(root == NULL) 
		{
			depth = 0;
			return true;
		}
		int leftdepth = 0;
		bool left = balance(root->left, leftdepth);
		int rightdepth = 0;
		bool right = balance(root->right, rightdepth);
		depth = leftdepth > rightdepth ? leftdepth+1 : rightdepth+1;
		int gap = leftdepth - rightdepth;
		return left && right && (-1 <= gap && gap <= 1);
	}
	bool isBalanced(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int depth = 0;
		return balance(root, depth);
    }