-
Notifications
You must be signed in to change notification settings - Fork 0
/
BalancedBinaryTree.py
43 lines (38 loc) · 960 Bytes
/
BalancedBinaryTree.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
class Solution:
def isBalanced(self, root):
"""
:type root: TreeNode
:rtype: bool
"""
def getDepth(root):
if root==None:
return 0
ldepth = getDepth(root.left)
if ldepth==-1:
return -1
rdepth = getDepth(root.right)
if rdepth==-1:
return -1
if abs(ldepth-rdepth)>1:
return -1
return max(ldepth, rdepth)+1
return getDepth(root)!=-1
if __name__=='__main__':
root=TreeNode(1);
a=TreeNode(2);
b=TreeNode(3);
c=TreeNode(4);
d=TreeNode(5);
e=TreeNode(6);
root.left=a;
root.right=b;
a.left=c;
a.right=d;
c.left=e;
solution = Solution()
print(solution.isBalanced(root))