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) -------------------------------------- [email protected] [email protected] [email protected] [email protected] -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
