Construct Binary Tree from Preorder and Inorder Traversal
Description
Construct Binary Tree from Preorder and Inorder Traversal
Notice
You may assume that duplicates do not exist in the tree.
Example
Given in-order [1,2,3] and pre-order [2,1,3], return a tree:
2
/ \
1 3