Had this question been already discussed .. someone pls give me the algo/logic.
Given a Binary Tree, Convert it into Doubly Linked List where the nodes are represented Spirally. For Example :- A B C ----> ABCGED || ACBDEG D E G ~raju -- 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.
