Binary Tree Path C ++ [closed]

I'm solving this exercise: link , but I do not know the logic of, from the result of the search in a tree of pre-order and order, get the result of post-order, that is, it give me the result of the search in pre-order and in order and I have to show the post-order. Could someone help me?