restoreBinaryTree

Problem Statement: Given the inorder and preorder traversals of a binary tree t, but not t itself, restore t and return it. We can start by taking the first element of preorder array and set it as root, and then we can recursively make its left and ...