## Construct Binary Tree from Inorder and Postorder Traversal
### 描述
Given inorder and postorder 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-inorder-and-postorder-traversal."+book.suffix, language=book.suffix %}{% endcodesnippet %}
### 相关题目
* [Construct Binary Tree from Preorder and Inorder Traversal](construct-binary-tree-from-preorder-and-inorder-traversal.md)