data structure


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, compact 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.

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 8 June 2023.
HTML page formatted Wed Aug 9 16:21:12 2023.

Cite this as:
Paul E. Black, "data structure", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 8 June 2023. (accessed TODAY) Available from: