题解 | #判断是不是平衡二叉树#

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param pRoot TreeNode类 
# @return bool布尔型
#
class Solution:
    def deep(self,root):
        if not root:
            return 0
        left = self.deep(root.left)
        right = self.deep(root.right)
        return max(left, right) + 1
    def IsBalanced_Solution(self , pRoot: TreeNode) -> bool:
        if not pRoot: return True

        left = self.deep(pRoot.left)
        right = self.deep(pRoot.right)

        if left - right > 1 or left - right < -1:
            return False

        return self.IsBalanced_Solution(pRoot.left) and self.IsBalanced_Solution(pRoot.right)