Balanced Binary Tree

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

原创最新推荐文章于 2023-04-13 15:01:12 发布 · 692 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

86 篇文章

订阅专栏

本文讨论了如何通过递归方式判断给定的二叉树是否为高度平衡二叉树，即任意节点的左右子树深度之差不超过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 is_balanced = true;
    int checkHieght(TreeNode *root) {
        int lh = 0, rh = 0;
        if(root == NULL || is_balanced == false) return 0;
        if(root->left != NULL && is_balanced == true) 
            lh = checkHieght(root->left) + 1;
        if(root->right != NULL && is_balanced == true) 
            rh = checkHieght(root->right) + 1;
        if(abs(lh - rh) > 1) is_balanced = false;
        return lh > rh ? lh : rh;
    }
    bool isBalanced(TreeNode *root) {
        checkHieght(root);
        return is_balanced;
    }
};