class Solution:
def isBalanced(self, root: TreeNode) -> bool:
def height(root:TreeNode)-> int:
if not root:
return 0
leftHeight = height(root.left)
rightHeight = height(root.right)
if leftHeight == -1 or rightHeight == -1 or abs(leftHeight-rightHeight) > 1:
return -1
else :
return max(leftHeight,rightHeight) + 1
return height(root) >= 0
自顶而下的递归遍历整个二叉树
其中:
if leftHeight == -1 or rightHeight == -1 or abs(leftHeight-rightHeight) > 1:
return -1
当满足abs(leftHeight-rightHeight) > 1,即二叉树的高度大于1,则返回-1,那么接下来会造成leftHeight 或者rightHeight 会为-1,那么一直会返回-1,到最后的return height(root) >= 0,就会返回false,即为不平衡二叉树。
二叉树的深度会因为return max(leftHeight,rightHeight) + 1这句,从下往上加深度。