110. Balanced Binary Tree

最新推荐文章于 2020-08-17 08:27:00 发布

qustJHJ

最新推荐文章于 2020-08-17 08:27:00 发布

阅读量246

点赞数

分类专栏： leetCode 文章标签： tree

本文链接：https://blog.csdn.net/qustDrJHJ/article/details/77963148

版权

leetCode 专栏收录该内容

171 篇文章 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.

*/
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isBalanced(TreeNode* root) {
        if(!root) return true;
        return depth(root)!=-1;
    }
    int depth(TreeNode* root)
    {
        if(!root) return 0;
        int leftdepth=depth(root->left);
        if(leftdepth==-1) return -1;
        int rightdepth=depth(root->right);
        if(rightdepth==-1) return -1;
        if(abs(leftdepth-rightdepth)>1) return -1;
        return max(leftdepth,rightdepth)+1;
    }
};