we can use m-way search tree to save some space. And reconstruction is pretty simple as all of us know. any suggestions?
On Sun, Aug 28, 2011 at 10:43 PM, Dhriti Khanna <dhriti0...@gmail.com>wrote: > @ Navneet: See if the tree is: 6 > 4 7 > 3 5 8 > > Then the preorder traversal is : 6 4 3 5 7 8 > And using this preorder traversal and inserting them in the tree one by > one, we generate this exact tree. > > > > -- > 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. > -- ........................ *MOHIT VERMA* -- 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.