in one special case of binary tree where each internal node has 2 children; we can construct binary tree from these pre and postorder traversals.
On Wed, Aug 8, 2012 at 12:11 PM, Navin Kumar <algorithm.i...@gmail.com>wrote: > @shiv narayan: we are not going to create exact tree as original. You > have to build full binary tree where as original tree may / may not be full > binary tree. > > > On Wed, Aug 8, 2012 at 2:31 AM, shiv narayan <narayan.shiv...@gmail.com>wrote: > >> Preorder and postorder do not uniquely define a binary tree. >> so question is vague . >> >> On Sunday, 15 July 2012 01:41:15 UTC+5:30, Navin Kumar wrote: >> >>> Given Preorder and postorder traversals of a tree. Device an algorithm >>> to constuct a fully binary tree from these traversals. >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To view this discussion on the web visit >> https://groups.google.com/d/msg/algogeeks/-/xaHfTySoo58J. >> >> To post to this group, send email to algogeeks@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
