Also useless if what is given is the pointer to the last node, in which case the next pointer of last but one node will only remain dangling.
Thanks, Balaji. On Wed, Mar 16, 2011 at 7:31 PM, Gene <[email protected]> wrote: > I think Wirth mentions this idea in Algorithms + Data Structures = > Programs, which dates from the 70's. > > Of course this technique is useless if other pointers to the deleted note > can exist. > > > > -- > 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.
