1->2->3->4->5 Start from any position ,have two pointers ,let that be a and b.Let a follow b,so that when b reaches right value ,a will be one node lacking,once b node is to be deleted,get the address of b node pointing and change the address of a pointing to the address b pointing to.
1->2->3->4->5 ^ ^ | | a b -- 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.
