leetcode 110 Balanced Binary Tree

最新推荐文章于 2021-11-23 20:59:43 发布

GoRunningSnail

最新推荐文章于 2021-11-23 20:59:43 发布

阅读量162

点赞数

分类专栏： LeetCode LeetCode刷题笔记

本文链接：https://blog.csdn.net/happyjume/article/details/85269705

版权

LeetCode 同时被 2 个专栏收录

46 篇文章 0 订阅

订阅专栏

LeetCode刷题笔记

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

Example 1:

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

判断一个二叉树是否为高度平衡的二叉树。该题的第一个思路是递归计算每个节点左右子树的高度，然后判断是否为高度平衡。代码如下（此处直接照搬leetcode上别人的代码）：

class solution {
public:
    int depth (TreeNode *root) {
        if (root == NULL) return 0;
        return max (depth(root -> left), depth (root -> right)) + 1;
    }

    bool isBalanced (TreeNode *root) {
        if (root == NULL) return true;
        
        int left=depth(root->left);
        int right=depth(root->right);
        
        return abs(left - right) <= 1 && isBalanced(root->left) && isBalanced(root->right);
    }
};

分析可知，这种情况下求每次节点的深度复杂度为O(n)，则总的复杂度为O(n^2)，直觉上可知应该有更优解。我们仔细查看求深度的帮助函数，可以在遍历每个节点处判断是否为平衡，若不平衡，则其根节点也不平衡，整棵树也不平衡，我们定义不平衡时其高度为-1这个标志，可实现复杂度为O(n)的算法，算法记录如下：

/**
 * 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) {
        return dfsHeight(root) != -1;
    }
    
    int dfsHeight(TreeNode* root)
    {
        if(!root)
            return 0;
        int left_height = dfsHeight(root->left);
        if(left_height == -1) return -1;
        int right_height = dfsHeight(root->right);
        if(right_height == -1) return -1;
        if((left_height - right_height) > 1 || (right_height - left_height) > 1)
            return -1;
        return max(left_height, right_height) + 1;
    }
};