Path in C++ Binary Tree

Asked

Viewed 246 times

2

I’m solving this exercise : http://br.spoj.com/problems/PREEMPOS/, but I do not know the logic of, from the result of the search in a tree of pre-order and order, arriving at the result of post-order, ie, he 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?

  • There is already a similar question : Please check the link http://stackoverflow.com/questions/3002234/how-do-i-output-the-preorder-traversal-of-a-tree-given-the-inorder-and-postorder

No answers

Browser other questions tagged

You are not signed in. Login or sign up in order to post.