Let the present node be X, Crete a new node 'Y' and give X->next=Y. Then swap(X->data,Y->data)
On 8 August 2011 09:06, Abhishek Gupta <mailatabhishekgu...@gmail.com>wrote: > Errata: > sorry guys.. > there is a change in the problem.. actually we have to INSERT a NEW NODE > before the current pointer. > Now tell is it possible.. > or again it is a stupid question.. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/JTEcmoixuksJ. > > 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. > -- With Regards, N.Vamshi Vijay, Mtech,CSE IIT Kharagpur Mobile:-07501541110 -- 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.
