-
Notifications
You must be signed in to change notification settings - Fork 26
/
python3.py
38 lines (32 loc) · 909 Bytes
/
python3.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
class Node:
def __init__(self,data):
self.right=self.left=None
self.data = data
class Solution:
def insert(self,root,data):
if root==None:
return Node(data)
else:
if data<=root.data:
cur=self.insert(root.left,data)
root.left=cur
else:
cur=self.insert(root.right,data)
root.right=cur
return root
def getHeight(self,root):
left = 0
right = 0
if not root.right is None:
right = 1 + self.getHeight(root.right)
if not root.left is None:
left = 1 + self.getHeight(root.left)
return max([left, right])
T=int(input())
myTree=Solution()
root=None
for i in range(T):
data=int(input())
root=myTree.insert(root,data)
height=myTree.getHeight(root)
print(height)