https://leetcode.cn/problems/balanced-binary-tree/
给定一个二叉树,判断它是否是高度平衡的二叉树。
本题中,一棵高度平衡二叉树定义为:
一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1 。
示例 1:
输入:root = [3,9,20,null,null,15,7]
输出:true
class Solution:
def isBalanced(self, root: Optional[TreeNode]) -> bool:
# 后序遍历求高度,高度判断平衡
def getheight(node):
if not node:
return 0
leftheight = getheight(node.left)
rightheight = getheight(node.right)
if leftheight == -1 or rightheight == -1 or abs(leftheight - rightheight) > 1:
return -1
else:
return 1 + max(leftheight, rightheight)
return getheight(root) != -1