wat if u have odd no of nodes
On Tue, Jan 24, 2012 at 12:00 AM, atul anand <[email protected]>wrote: > one simple way would be using stacks. > push node,node->next; > then pop() , and reversing the pointers. > > On Mon, Jan 23, 2012 at 11:46 PM, Ankur Garg <[email protected]> wrote: > >> Say LL is >> >> 1->2->3->4->5->6->7->8 >> >> Then u need to return >> >> 7->8->5->6->3->4->1->2 >> >> U cant swap the values ....U have to rearrange the ptr... >> >> >> -- >> 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. >> > > -- > 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. > -- 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.
