@Dhriti, can you explain your point with any example? Two traversals(inorder compulsory) are required to uniquely construct a tree. It's not that you just want to create any BST with same nodes. Original tree needs to be constructed. Let me know if you disagree.
On Aug 28, 6:03 pm, Dhriti Khanna <dhriti0...@gmail.com> wrote: > @Navneet: I think only saving the preorder traversal will do. O(n). > Inserting back into that order will give me the original tree back.. -- 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.
