This preview shows page 1. Sign up to view the full content.
Unformatted text preview: A linked implementation is based on the concept of a node . A node is made up of two pieces of data: the item that the user wants in the list and a pointer to the next node in the list. A pointer to the first node in a list is saved in a named variable, called the external pointer to the container (list). The pointer variable of the last node in the list contains a symbol that means the end of the list, usually null . Figure 9.4 shows the anatomy of a linked list....
View Full Document
- Fall '10