leetcode 110 .Balanced Binary Tree

井井帆

于 2017-08-14 22:29:15 发布

阅读量188

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/jignjingfan/article/details/77170840

本文介绍了一种用于判断二叉树是否为高度平衡的算法。通过递归地计算每个节点左右子树的深度，并确保任意节点的左右子树深度之差不超过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.

AC代码：

class Solution {
public:
    bool IsBalanced_Solution(TreeNode* pRoot) {
              if(depth(pRoot)==-1)
                  return false;
        return true;
    }
    int depth(TreeNode* root){
        if(root==nullptr)
            return 0;
        int left=depth(root->left);
        int right=depth(root->right);
        if(left==-1||right==-1||fabs(left-right)>1)
            return -1;
        return max(left,right)+1;
    }
};