下面是判断一棵二叉树是否为平衡二叉树的 Python 代码:
# 定义二叉树节点类class TreeNode:
def __init__(self, val=None, left=None, right=None):
self.val = val
self.left = left
self.right = right
# 定义辅助函数,计算二叉树的高度
def get_height(root: TreeNode) -> int:
if not root:
return 0
return max(get_height(root.left), get_height(root.right)) + 1
# 定义主函数,判断二叉树是否为平衡二叉树
def is_balanced(root: TreeNode) -> bool:
if not root:
return True
# 计算左右子树的高度差
diff = abs(get_height(root.left) - get_height(root.right))
# 如果高度差大于1或左右子树不平衡,则当前二叉树不平衡
if diff > 1 or not is_balanced(root.left) or not is_balanced(root.right):
return False
return True