postOrder to preOrder algorithm

Does anyone know of a quick way to convert from postorder to preorder?  We're trying to convert from postorder input of a binary tree traversal, to inorder and preorder.  We've got inorder down, but can't think of a universal way to get to preorder.

P.S. Python sucks for a data structures class.