You may assume that duplicates do not exist in the tree. See 'Construct tree from inorder + postorder' as example. This problem uses divide and conquer idea as well. For preorder: the front node is ...