The purpose of this paper is to demonstrate that you can derive the post-order index of a node from the pre-order index of the node if you know the depth of the node (called parent count) and the node's total number of children (called child count).
Using a tree as defined here.