I know its not about the traversal....i just suggested that one can use the trick used by Morris traversal to locate the next node of the inorder traversal...
On 7/4/11, Navneet Gupta <navneetn...@gmail.com> wrote: > @Piyush, it is not about the traversal, you actually have to establish > those links such that once they are established, inorder traversal > would be just like traversing a list. > > @Sunny - thanks, exactly what i was looking for > > On Mon, Jul 4, 2011 at 11:45 PM, Piyush Sinha <ecstasy.piy...@gmail.com> > wrote: >> http://geeksforgeeks.org/?p=6358 >> >> On 7/4/11, Piyush Sinha <ecstasy.piy...@gmail.com> wrote: >>> Use the concept used in Morris traversal (same as TBT concept)... >>> >>> >>> >>> On 7/4/11, sunny agrawal <sunny816.i...@gmail.com> wrote: >>>> I think Threaded Binary Tree solves your Problem >>>> see this <http://en.wikipedia.org/wiki/Threaded_binary_tree> >>>> >>>> On Mon, Jul 4, 2011 at 11:34 PM, Navneet Gupta >>>> <navneetn...@gmail.com>wrote: >>>> >>>>> Tree has an extra pointer "next" apart from left and right. Objective >>>>> is to set next pointer to point to node successor in the tree. >>>>> Following the next pointer, we would be able to produce sorted list. >>>>> >>>>> Looking for both a recursive and non-recursive approach. >>>>> >>>>> --Navneet >>>>> >>>>> -- >>>>> 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. >>>>> >>>>> >>>> >>>> >>>> -- >>>> Sunny Aggrawal >>>> B-Tech IV year,CSI >>>> Indian Institute Of Technology,Roorkee >>>> >>>> -- >>>> 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. >>>> >>>> >>> >>> >>> -- >>> *Piyush Sinha* >>> *IIIT, Allahabad* >>> *+91-8792136657* >>> *+91-7483122727* >>> *https://www.facebook.com/profile.php?id=100000655377926 * >>> >> >> >> -- >> *Piyush Sinha* >> *IIIT, Allahabad* >> *+91-8792136657* >> *+91-7483122727* >> *https://www.facebook.com/profile.php?id=100000655377926 * >> >> -- >> 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. >> >> > > > > -- > Navneet > > -- > 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. > > -- *Piyush Sinha* *IIIT, Allahabad* *+91-8792136657* *+91-7483122727* *https://www.facebook.com/profile.php?id=100000655377926 * -- 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.
