Linked Lists

Steven J. Zeil

Old Dominion University, Dept. of Computer Science

Table of Contents

1. Linked Lists: the Basics
1.1. Traversing Linked Lists
1.2. Inserting into Linked Lists
1.3. Removing from Linked Lists
2. Coding for Linked Lists
2.1. Utils, not ADTs
2.2. Example:Using the LListHeader
2.3. Traversing a Linked List
2.4. Searching a Linked List
2.5. Adding to a Linked List
2.6. Removing from a Linked List
2.7. Copying and Clean-up
3. Variations: Headers with First and Last
3.1. Adding a Last Pointer
3.2.
4. Variations: Doubly-Linked Lists
4.1. addBefore: Singly Linked
4.2. addBefore: Doubly Linked
4.3.