Given the preorder/postorder and inorder traversal of a binary tree, we can always construct a unique binary tree (I think so, correct me if I am wrong)
Construct a binary tree with the nodes A, B, C such that its preorder traversal is ABC and its inorder traversal is CAB.