(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 ...)
bag.
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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 22 January 2009.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "list", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 22 January 2009. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/list.html
