CS Behind the Curtain (CS195 2003S)

Class 41: Extending Linked Lists: Doubly- and Circularly-Linked Lists

Back to Semantics of Iteration. On to Cancelled.

Held: Monday, 14 April 2003

Summary: We consider some data structure design decisions that will ease the implementation of certain operations.

Related Pages:



Implementing delete

Doubly-Linked Lists

Detour: ADTs vs. Data Structures

Circularly-Linked lists



Tuesday, 7 January 2003 [Samuel A. Rebelsky]

Sunday, 13 April 2003 [Samuel A. Rebelsky]


Back to Semantics of Iteration. On to Cancelled.

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 Fri May 2 14:21:02 2003.
The source to the document was last modified on Sun Apr 13 23:40:33 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS195/2003S/Outlines/outline.41.html.

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky, rebelsky@grinnell.edu