This would take so much of memory and CPU computations. This question can be done very easily if you have n then at the junction you can store pointer to n-1th node and pointer to n+1th node. Then you have to just print from n-1th node to 0th node and then print from node.size()th to n+1th node....!!!
-- Akshat Sapra Under Graduation(B.Tech) IIIT-Allahabad(Amethi Campus) -------------------------------------- sapraaks...@gmail.com akshatsapr...@gmail.com rit2009...@iiita.ac.in sapraaks...@facebook.com -- 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.
