CS 102 Lecture Notes
Week Seven, Thursday: Linked Lists (continued)
The Bag ADT Implemented with a Linked List
We revisit the Bag ADT with a linked list implementation.
The List ADT Implemented with a Linked List
A doubly linked list connected into a ring is the most flexible
and useful variant. While the ring feature may not be used by many
algorithms, there are some algorithms that are more easily implemented
using a ring data structure. The ring also makes it easy test for an
invalid node (no ring node ever has a NULL pointer).
This page established September 29, 1999; last updated September 29, 1999.