110. 平衡二叉树

# 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: Optional[TreeNode]) -> bool:def get_height(root):if not root:return 0left_height = get_height(root.left)right_height = get_height(root.right)if left_height == -1:return -1if right_height == -1:return -1if abs(left_height - right_height) > 1:return -1else:return 1 + max(left_height, right_height)if get_height(root) != -1:return Trueelse:return False