# 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
bl = self.treeHeight(root.left)
br = self.treeHeight(root.right)
if abs(bl - br) > 1:
return False
else:
return self.isBalanced(root.left) and self.isBalanced(root.right)
def treeHeight(self, root):
if root == None:
return 0
return max(self.treeHeight(root.left), self.treeHeight(root.right)) + 1
Python, LeetCode, 110. 平衡二叉树
最新推荐文章于 2022-10-20 19:47:20 发布