Medium Accuracy: 51.23% Submissions: 4084 Points: 4
Given inorder and level-order traversals of a Binary Tree, construct the Binary Tree and return the root Node.
First line consists of T test cases. First line of every test case consists of N, denoting number of elements is respective arrays. Second and third line consists of arrays containing Inorder and Level-order traversal respectively.
Single line output, print the preOrder traversal of array.