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.
