Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #User function Template for python3
- link="https://practice.geeksforgeeks.org/problems/construct-tree-1/1"
- class Solution:
- def buildtree(self, inorder, preorder, n):
- def help(inorder,preorder):
- if not inorder and not preorder:return None
- mid=inorder.index(preorder[0])
- t=Node(preorder[0])
- #skipping first element in preorder(root) and skipping the element at pos mid(root)
- t.left=help(inorder[:mid],preorder[1:mid+1])
- t.right=help(inorder[mid+1:],preorder[mid+1:])
- return t
- return help(inorder,preorder)
- #{
- # 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):
- n = int(input())
- inorder = [ int(x) for x in input().split() ]
- preorder = [ int(x) for x in input().split() ]
- root = Solution().buildtree(inorder, preorder, n)
- printPostorder(root)
- print()
- # } Driver Code Ends
Advertisement
Add Comment
Please, Sign In to add comment