leetcode - Balanced Binary Tree

最新推荐文章于 2024-11-11 20:59:17 发布

miao65272156

最新推荐文章于 2024-11-11 20:59:17 发布

阅读量299

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/miao65272156/article/details/29557641

版权

leetcode 专栏收录该内容

109 篇文章 0 订阅

订阅专栏

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:
    int checkdepth(TreeNode *node)
    {
        if(node == NULL)return 0;
        int l = checkdepth(node->left)+1;
        int r = checkdepth(node->right)+1;
        if((l == 0)||(r == 0)) return -1;
        if(l > r)
        {
            if(l-r > 1)return -1;
            else return l;
        }
        else
        {
            if(r-l >1)return -1;
            else return r;
        }
    }
    
    bool isBalanced(TreeNode *root) {
        if(checkdepth(root) == -1) return false;
        else return true;
        
    }
};