Module: Linked List

Dynamic Data Structures: Linked List Object

Prerequisites	Dynamic memory allocation
Objectives	Using memory allocation to create dynamic data structures Learn and use basic linked list patterns Wrap a linked list in a class
Concepts	Linked List Node, Head, Tail Inserting a new item in the list Deleting an item from the list Traversing the list Abstract Lists Objects
Experiments/ Examples:	Basic List using fixed size array Basic Single Pointer Linked List
Self Assessment
Assignments	This material is covered later in the book in Chapter 15. However it assumes that you have already studied templates. This web site contains similiar material but not using templates.