Construct binary tree from inorder and preorder traversal

-*+Construct binary tree from inorder and preorder traversal Given two traversals (inorder and preorder) of a binary search tree, Construct binary tree from inorder and preorder traversal For example,Inorder traversal is {10, 12, 20, 30, 37, 40, 45} and Preorder traversal is {30, 20, 10, 12, 40, 37, 45}; the resultant binary search tree should be as … Continue reading Construct binary tree from inorder and preorder traversal