题解 | 判断是不是平衡二叉树-记录左右子树的高度比较

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

        """
         记录左右子树的高度然后比较
        """
        ls1=[]
        ls2=[]
        def dfs(root):
            if not root:
                return 0
            left =dfs(root.left)+1
            right =dfs(root.right)+1
            ls1.append(left)
            ls2.append(right)

            return max(left,right)
        dfs(pRoot)
        for i in range(len(ls1)):
            if abs(ls1[i]-ls2[i])>1:
                return False
        return True