题目描述
输入一棵二叉树,判断该二叉树是否是平衡二叉树。
思路:
左右子树的高度相差不大于1,递归判断。
<--! 后期补代码 -->
C/C++:
Java:
Python:
法一:写一个计算树深度的函数,在判断平衡树的函数里调用 运行时间:32ms 占用内存:5736k
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def deep(self, root):
if root==None:
return 0;
return max(self.deep(root.left), self.deep(root.right)) + 1
def IsBalanced_Solution(self, root):
# write code here
if root==None:
return True
if(abs(self.deep(root.left)-self.deep(root.right))<2 and self.IsBalanced_Solution(root.left) and self.IsBalanced_Solution(root.right)):
return True
else:
return False
法二:直接把高度嵌入在judge函数中,并且False用-1表示,根据judge返回值判断,小于0则吧不是平衡树
运行时间:33ms
占用内存:5732k
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def judge(self, root):
if not root:
return 0
left = self.judge(root.left)
right = self.judge(root.right)
if (left<0 or right<0 or abs(left - right)>1 ):
return -1
return max(left , right)+1
def IsBalanced_Solution(self, pRoot):
# write code here
return self.judge(pRoot)>=0