# ---
# title: 105. Construct Binary Tree from Preorder and Inorder Traversal
# id: problem105
# author: Tian Jun
# date: 2020-10-31
# difficulty: Medium
# categories: Array, Tree, Depth-first Search
# link: <https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/>
# hidden: true
# ---
# 
# Given preorder and inorder traversal of a tree, construct the binary tree.
# 
# **Note:**  
# You may assume that duplicates do not exist in the tree.
# 
# For example, given
# 
#     
#     
#     preorder = [3,9,20,15,7]
#     inorder = [9,3,15,20,7]
# 
# Return the following binary tree:
# 
#     
#     
#         3
#        / \
#       9  20
#         /  \
#        15   7
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
