Construct Binary Tree from Preorder and Inorder Traversal (DFS，参考)

Given preorder and inorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.

给定一棵树的前序遍历和中序遍历，构建该树。