Create 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.

用stack存储当前节点，用inorder来pop_back()来判定是当前节点的左子树。
递归的方法会超出memory limit。