Reconstruct Binary Tree from Preorder and Inorder Traversal

Given two arrays representing the preorder and inorder traversals of the same binary tree with unique values, reconstruct the original tree.

Input: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7].

Output: The binary tree structure:

Try it yourself

Solution