题目描述
输入一棵二叉树,判断该二叉树是否是平衡二叉树。
平衡二叉树定义:它是一棵空树或它的左右两个子树的高度差的绝对值不超过1,并且左右两个子树都是一棵平衡二叉树。
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def IsBalanced_Solution(self, pRoot):
# write code here
return self.TreeDepth(pRoot)!=-1
def TreeDepth(self,root):
if not root :
return 0
left = self.TreeDepth(root.left)
right = self.TreeDepth(root.right)
if left ==-1 or right==-1 or abs(left-right)>1:
return -1
return max(left,right)+1