a data structure is a data organization and storage format that is usually chosen for efficient access to data. More precisely, a data structure is a...

In computer science, a heap is a tree-based data structure that satisfies the heap property: In a max heap, for any given node C, if P is the parent node...

In computer programming, a rope, or cord, is a data structure composed of smaller strings that is used to efficiently store and manipulate longer strings...

is a list of well-known data structures. For a wider list of terms, see list of terms relating to algorithms and data structures. For a comparison of running...

In computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when...

computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that stores a collection of...

Data structure alignment is the way data is arranged and accessed in computer memory. It consists of three separate but related issues: data alignment...

In computer science, an array is a data structure consisting of a collection of elements (values or variables), of same memory size, each identified by...

In computer science, a linked data structure is a data structure which consists of a set of data records (nodes) linked together and organized by references...

Semi-structured data is a form of structured data that does not obey the tabular structure of data models associated with relational databases or other...

minerals and chemicals. Abstract structures include data structures in computer science and musical form. Types of structure include a hierarchy (a cascade...

A data model explicitly determines the structure of data; conversely, structured data is data organized according to an explicit data model or data structure...

data structure or space-efficient data structure is a data structure that stores very little information other than the main or required data: a data...

A data structure diagram (DSD) is the visual representation of a certain kind of data model that contains entities, their relationships, and the constraints...

In computer science, a succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower bound...

technique of representing an aggregate data structure so that it is convenient for writing programs that traverse the structure arbitrarily and update its contents...

computer science, a retrieval data structure, also known as static function, is a space-efficient dictionary-like data type composed of a collection of...

functional data structure is a data structure that can be directly implemented in a purely functional language. The main difference between an arbitrary data structure...

possible operations on data of this type, and the behavior of these operations. This mathematical model contrasts with data structures, which are concrete...

compressed data structure arises in the computer science subfields of algorithms, data structures, and theoretical computer science. It refers to a data structure...

data structure (PDS), also termed a plain old data structure or plain old data (POD), is a record, in contrast with objects. It is a data structure that...

In computer science, a concurrent data structure (also called shared data structure) is a data structure designed for access and modification by multiple...

be part of the graph structure, or may be external entities represented by integer indices or references. A graph data structure may also associate to...

In computer science, a search data structure[citation needed] is any data structure that allows the efficient retrieval of specific items from a set of...

notable data structures, as measured by the complexity of their logical operations. For a more comprehensive listing of data structures, see List of data structures...

is a data structure that uses a single, fixed-size buffer as if it were connected end-to-end. This structure lends itself easily to buffering data streams...

set, one typically tests a value for membership in a set. Some set data structures are designed for static or frozen sets that do not change after they...

computer science, a tree is a widely used abstract data type that represents a hierarchical tree structure with a set of connected nodes. Each node in the...

The dictionary problem is the classic problem of designing efficient data structures that implement associative arrays. The two major solutions to the dictionary...

retroactive data structure is a data structure which supports efficient modifications to a sequence of operations that have been performed on the structure. These...