4.1-判断二叉树是否平衡(same in LeetCode)

最新推荐文章于 2024-12-11 20:52:04 发布

原创最新推荐文章于 2024-12-11 20:52:04 发布 · 566 阅读

0 ·

CC 4.0 BY-SA版权

CC150 专栏收录该内容

48 篇文章

订阅专栏

本文介绍了一种检查二叉树是否平衡的方法。平衡二叉树定义为任意两个叶子节点到根的距离之差不超过1。文章提供了一个递归算法实现，并通过计算每个节点的高度来判断整个树是否满足平衡条件。

Implement a function to check if a tree is balanced. For the purposes of this question, a balanced tree is defined to be a tree such that no two leaf nodes differ in distance from the root by more than one.

判断二叉树是否平衡。

leetcode: http://blog.youkuaiyun.com/todorovchen/article/details/18675329

int calBf(TreeNode* root, bool& bf)
{
   if(root==NULL)
    return 0;
   int leftHeight =  calBf(root->left, bf) + 1;
   int rightHeight =  calBf(root->right, bf) + 1;
   if(abs(rightHeight-leftHeight)>1)
   {
       bf=false;
       return -1;
   }
   return max(leftHeight,  rightHeight);
}
bool isBalanced(TreeNode *root)
{
    bool bf = true;
    calBf(root, bf);
    return bf;
}