Balanced Binary Tree

最新推荐文章于 2025-09-04 16:45:21 发布

转载最新推荐文章于 2025-09-04 16:45:21 发布 · 42 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/kwill/p/3166024.html

文章标签：

#c/c++

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

class Solution {
public:
    bool f(TreeNode *root, int & height){
        if (!root){
            height = 0;
            return true;
        }
        int left_h = 0, right_h = 0;
        bool left_c = f(root->left,left_h);
        bool right_c = f(root->right,right_h);
        height = max(left_h,right_h) + 1;
        return left_c && right_c && abs(left_h - right_h) <= 1;
    }
    bool isBalanced(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int height = 0;
        return f(root,height);
    }
};