算法精粹(algorithm-essentials)

感谢soulmachine@github提供内容
## Construct Binary Tree from Preorder and Inorder Traversal


### 描述

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

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


### 分析




### 代码

{% codesnippet "./code/construct-binary-tree-from-preorder-and-inorder-traversal."+book.suffix, language=book.suffix %}{% endcodesnippet %}


### 相关题目


* [Construct Binary Tree from Inorder and Postorder Traversal](construct-binary-tree-from-inorder-and-postorder-traversal.md)