Definition: An organization of information, usually in memory, for better algorithm efficiency, such as queue, stack, linked list, heap, dictionary, and tree, or conceptual unity, such as the name and address of a person. It may include redundant information, such as length of the list or number of nodes in a subtree.
Specialization (... is a kind of me.)
external memory data structure, passive data structure, active data structure, persistent data structure, recursive data structure.
See also abstract data type.
Note: Most data structures have associated algorithms to perform operations, such as search, insert, or balance, that maintain the properties of the data structure.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 15 December 2004.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Paul E. Black, "data structure", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 15 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/dataStructure.html