I can only figure out the inorder traversal... On Thu, Aug 26, 2010 at 9:59 AM, krazee koder <aravindhr...@gmail.com> wrote: > Give all possible methods to flatten a binary tree to a linked list. > > for eg. > > 50 > / \ > 25 60 > / \ / \ > 5 30 55 75 > > > should be flattened to 5->25->30->50->55->60->75 > > PS: note that the tree should be converted to the LL and no separate > LL should be formed. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@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 algoge...@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.
