The first lecture describes how to create a circular singly linked list.

The second lecture introduces doubly linked lists.

The third lecture completes the coverage of doubly linked lists. The slides are the same as a previous lesson.

The tutorial contains questions on circular and doubly linked lists.

In this week's lab, you will start on a new backlog: the Linked List Backlog. You will be implementing simple linked lists.

You will demonstrate merge and quick sorts to complete the Arrays backlog.

This is the backlog you will be working from this week. It uses material covered in prevous classes. You will be demoing material from the Arrays Backlog this week and next.

This is the backlog for the material covered in lecture this week. You will start working on it this week to demo next week.

Get the code for the next two demos using wget ds.nathanielgmartin.com/LinkedList.zip. This file contains the code for the next two demos (i.e., the demos for week 7 and week 8.) For week 7, you need only complete stories (1-6), just leave blank the stories for the functions for week 8 (i.e., stories 7 - 12).