leetcode110-python 平衡二叉树

最新推荐文章于 2026-04-12 12:53:31 发布

原创最新推荐文章于 2026-04-12 12:53:31 发布 · 1.5k 阅读

3 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode-简单

收录于

leetcode 专栏收录该内容

25 篇文章

订阅专栏

本文介绍了一种算法，用于判断一棵二叉树是否为高度平衡的二叉树。通过递归计算每个节点的左右子树的最大深度，并确保两者之差不超过1来实现。提供了具体的Python实现代码。

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.利用之前判定二叉树最大深度的函数，左右子树层数相减不大于1即为平衡树；

# 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
        elif abs(self.height(root.left)-self.height(root.right))>1:
            return False
        else:
            return self.isBalanced(root.left) and self.isBalanced(root.right)
    
    def height(self,root):
        if root == None:
            return 0
        else:
            return max(self.height(root.left),self.height(root.right))+1