平衡二叉树

15332019张胜利

于 2018-10-21 21:49:22 发布

阅读量103

点赞数

分类专栏： C++

本文链接：https://blog.csdn.net/j515332019/article/details/83245932

版权

C++ 专栏收录该内容

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

Example 1:

Given the following tree [3,9,20,null,null,15,7]:

Return true.

Example 2:

Given the following tree [1,2,2,3,3,null,null,4,4]:

Return false.

解决方法：求出两端高度，比较是否相差大于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:
    int height(TreeNode *root, bool &ans)
    {
        if (!root) return 0;
        int h1 = height(root->left, ans);
        int h2 = height(root->right, ans);
        if (abs(h1 - h2) > 1) ans = false;
        return 1 + max(h1, h2);        
    }
    
    bool isBalanced(TreeNode* root) {
        bool ans = true;
        height(root, ans);
        return ans;
    }

};