39.平衡二叉树(python)

题目描述

输入一棵二叉树，判断该二叉树是否是平衡二叉树。

class Solution:
    def IsBalanced_Solution(self, pRoot):
        # write code here
        if pRoot == None:
            return True
        if abs(self.Depth(pRoot.left)-self.Depth(pRoot.right))>1:
            return False
        return self.IsBalanced_Solution(pRoot.left) and self.IsBalanced_Solution(pRoot.right)
    def Depth(self,pRoot):
        if pRoot==None:
            return 0
        left=self.Depth(pRoot.left)
        right=self.Depth(pRoot.right)
        return max(left+1,right+1)

2019-12-25 16:47:38