#平衡二叉树
def isBlancedTree(root):
res = True
def helper(root):
if not root:
return -1
left = helper(root.left) + 1
right = helper(root.right) + 1
if abs(right - left) > 1:
res = False
return max(left, right)
helper(root)
return res
leetcode 110 平衡二叉树
于 2024-04-26 17:40:40 首次发布