CSC161 2010F Imperative Problem Solving

Class 50: Alterative Linked Structures: Doubly-Linked Lists

Back to Deleting Elements from Linked Lists. On to Designing More ADTs: Stacks and Queues.

This outline is also available in PDF.

Held: Tuesday, 30 November 2010

Summary: We continue our consideration of linked lists by exploring how an extra link can make deletion easier.

Related Pages:

Notes:

Overview:

Back to Deleting Elements from Linked Lists. On to Designing More ADTs: Stacks and Queues.

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Wed Dec 8 10:57:19 2010.
The source to the document was last modified on Fri Aug 27 07:12:24 2010.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CSC161/2010F/Outlines/outline.50.html.

Samuel A. Rebelsky, rebelsky@grinnell.edu