[LeetCode] 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.