Leetcode 110. Balanced Binary Tree (Easy) 平衡二叉树

最新推荐文章于 2022-06-07 16:52:48 发布

桔兮

最新推荐文章于 2022-06-07 16:52:48 发布

阅读量131

点赞数 1

分类专栏： Leetcode

本文链接：https://blog.csdn.net/weixin_40449071/article/details/81123862

版权

Leetcode 专栏收录该内容

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

一个二叉树，其中每个节点的两个子树的深度从不相差超过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.

代码：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def isBalanced(self, root):
        """
        :type root: TreeNode
        :rtype: bool
        """
        
        if root == None:
            return True
        leftHeight = self.Height(root.left)
        rightHeight = self.Height(root.right)
        if abs(leftHeight - rightHeight)<=1:
            return self.isBalanced(root.left) and self.isBalanced(root.right)
        return False
        
        
    def Height(self,root):
        if root == None:
            return 0
        return 1+max(self.Height(root.left),self.Height(root.right))

思想：从根节点开始往下逐层遍历每个子节点直至叶子节点，求出左右子节点的深度再求差；一旦出现差值大于1的情况，就返回False。

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def isBalanced(self, root):
        """
        :type root: TreeNode
        :rtype: bool
        """
        if not root:
            return True
        elif abs(self.Depth(root.left)-self.Depth(root.right)) > 1:
            return False
        else:
            return self.isBalanced(root.left) and self.isBalanced(root.right)
    
    def Depth(self,root):
        if not root:
            return 0
        return max(self.Depth(root.left),self.Depth(root.right))+1