Leetcode 110: Balanced Binary Tree

题目：


python3代码：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def isBalanced(self, root: TreeNode) -> bool:
        if not root:
            return True
        return self.isBalanced(root.left) and self.isBalanced(root.right) and abs(self.getHeight(root.left) - self.getHeight(root.right)) <=1
        
    
    def getHeight(self, root: TreeNode) -> int:
        if not root:
            return 0
        leftHeight = self.getHeight(root.left)
        rightHeight = self.getHeight(root.right)
        if leftHeight > rightHeight:
            return leftHeight + 1
        else:
            return rightHeight + 1

思路：
根据题目的说法，两边的子树高度不超过1，就是平衡树，那么就可以根据整体高度来判断

如果觉得不错，就点赞或者关注或者留言~
谢谢~