(data structure)

Definition: A collection of items accessible one after another beginning at the head and ending at the tail.

Generalization (I am a kind of ...)

Specialization (... is a kind of me.)
linked list, doubly linked list, circular list, self-organizing list, ordered linked list.

Aggregate parent (I am a part of or used in ...)
orthogonal lists.

Note: A list may have additional access methods. A list may be ordered. A list can be seen as an ordered bag. A list may be kept as the leading items of an array, but inserting items other than at the end takes time.

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 22 January 2009.
HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:
Paul E. Black, "list", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 22 January 2009. (accessed TODAY) Available from: