Leetcode 110. Balanced Binary Tree

最新推荐文章于 2024-09-20 15:28:15 发布

Balr-Lector

最新推荐文章于 2024-09-20 15:28:15 发布

阅读量252

点赞数

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

本文链接：https://blog.csdn.net/qq_36445757/article/details/75807690

版权

Leetcode 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

110. Balanced Binary Tree

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 help(TreeNode *root,int &height){
        if(root==0){
            height=0;
            return true;
        }
        int height1,height2;
        if(!help(root->left,height1)){
            return false;
        }
        if(!help(root->right,height2)){
            return false;
        }
        height=max(height1,height2)+1;
        return (height1>=height2-1)&&(height1<=height2+1);
    }
    bool isBalanced(TreeNode* root) {
        int height;
        return help(root,height);
    }
};