-
-
Notifications
You must be signed in to change notification settings - Fork 27
/
Copy pathFebruary-06.py
59 lines (46 loc) · 1.22 KB
/
February-06.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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#User function Template for python3
'''
# Node class
class Node:
def __init__(self,val):
self.data = val
self.right = None
self.left = None
'''
# Note: Build tree and return root node
class Solution:
def buildTree(self, inorder, preorder):
m = {v: i for i, v in enumerate(inorder)}
self.i = 0
def f(l, r):
if l > r: return None
root = Node(preorder[self.i])
self.i += 1
pos = m[root.data]
root.left = f(l, pos - 1)
root.right = f(pos + 1, r)
return root
return f(0, len(inorder) - 1)
#{
# Driver Code Starts
#Initial Template for Python 3
class Node:
def __init__(self, val):
self.data = val
self.right = None
self.left = None
def printPostorder(n):
if n is None:
return
printPostorder(n.left)
printPostorder(n.right)
print(n.data, end=' ')
if __name__ == "__main__":
t = int(input())
for _ in range(t):
inorder = [int(x) for x in input().split()]
preorder = [int(x) for x in input().split()]
root = Solution().buildTree(inorder, preorder)
printPostorder(root)
print()
# } Driver Code Ends