|All-time Popular Problems|
|Delete keys in a Linked list|
|Delete Middle of Linked List|
|Max sum in the configuration|
|Given a linked list of 0s, 1s and 2s, sort it.|
|Top View of Binary Tree|
|Linked List Insertion|
|Boundary Traversal of binary tree|
|n'th node from end of linked list|
Given 2 Arrays of Inorder and preorder traversal. Construct a tree and print the Postorder traversal.
First line consists of T test cases. First line of every test case consists of N , denoting the number of elements in array. Second and Third line of every test case consists of Inorder and preOrder traversal of a tree.
Single line output, return the Node of the tree.
3 1 4 0 5 2 6
0 1 3 4 2 5 6
3 4 1 5 6 2 0