5.1.12+Describe+how+linked+lists+operate+logically

In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. They can be used to implement several other common abstract data types, including stacks, queues, associative arrays, and S-expressions.

[[image:compsci2014/474px-CPT-LinkedLists-addingnode.svg.png]]

 * Pointer **

Pointer/Pointee A "pointer" stores a reference to another variable sometimes known as its "pointee". Alternately, a pointer may be set to the value NULL which encodes that it does not currently refer to a pointee.