Computer Science Fundamentals (CS153 2004S)

Class 46: Implementing Lists with Nodes

Back to Determining Position Validity. On to Linear Structures.

Held: Thursday, 22 April 2004

Summary: Today we consider how to build lists from nodes, which are much like Scheme pairs. Such lists are typically called linked lists.

Related Pages:

Overview:

Detour: Invalidating Positions

Implementing Lists with Nodes

Variants

 

History

 

Back to Determining Position Validity. On to Linear Structures.

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 7 09:43:32 2004.
The source to the document was last modified on Tue Jan 13 10:26:12 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS153/2004S/Outlines/outline.46.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu