Linked List Nodes

A linked list node has two components
- A value (data) that contains the list element a_i.
- A pointer (next) that points to the node containing list element a_{i + 1}.
Nodes are allocated and deallocated dynamically.
The linked list always has allocated the exact number of nodes necessary to store the list elements.
The node constructors are private
- They can be invoked only by friend classes.
Public interface
- T& Value() - Returns a reference to the data member of the node.
- LinkedListNode* Next() - Returns a copy of the pointer to the next node.
Example - linkedlistnode.h (original), linkedlistnode.h (copy),
ListTest.cpp

This page was last modified on Feb 22, 2001

URL: http://people.hsc.edu/faculty-staff/robbk/Coms262/Lectures/LinkedListNodes.html