@akshat- can you provide any example or code for your idea...tht would help me to understand your method in a better way..
On Wed, Aug 31, 2011 at 12:18 PM, Akshat Sapra <[email protected]>wrote: > > > 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. > -- Mohit kumar lal rit2009014 IIIT ALLAHABAD contact@9454681805 [email protected] [email protected] [email protected] http://profile.iiita.ac.in/rit2009014 -- 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.
