Balanced Binary Tree

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

Nereus_Li

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

阅读量597

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/li_chihang/article/details/44226839

LeetCode 专栏收录该内容

113 篇文章

订阅专栏

本文介绍了一种用于判断二叉树是否为高度平衡的方法。高度平衡二叉树定义为对于每个节点，其两个子树的深度之差不超过1。通过递归方式计算节点的最大深度并检查是否满足平衡条件。

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.

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

struct TreeNode {
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
bool FLAG = true;
int MaxDepth(TreeNode* root )
{
	if (root == NULL||FLAG==false)
		return 0;
	int leftdepth = MaxDepth(root->left);
	int rigtdepth = MaxDepth(root->right);
	if (abs(leftdepth - rigtdepth) > 1){
		FLAG = false;
		return -1;
	}
	else if (leftdepth < rigtdepth)
		return rigtdepth + 1;
	else
		return leftdepth + 1;	
}
bool isBalanced(TreeNode *root) {

	MaxDepth(root);
	return FLAG;
}