an abstract data type (ADT) is a mathematical model for data types, defined by its behavior (semantics) from the point of view of a user of the data, specifically...

In computer science, a list or sequence is an abstract data type that represents a finite number of ordered values, where the same value may occur more...

buffer Double-ended queue (deque) Priority queue Queuing theory Stack (abstract data type) – the "opposite" of a queue: LIFO (Last In First Out) "Queue (Java...

In computer science, a stack is an abstract data type that serves as a collection of elements with two main operations: Push, which adds an element to...

In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph...

that types differ in their methods.: 281  List of data structures Standard Template Library#Containers Collection (abstract data type) Stack data structure...

In computer science, a set is an abstract data type that can store unique values, without any particular order. It is a computer implementation of the...

collection is a concept applicable to abstract data types, and does not prescribe a specific implementation as a concrete data structure, though often there is...

computer science and computer programming, a data type (or simply type) is a collection or grouping of data values, usually specified by a set of possible...

In computer science, a pile is an abstract data type for storing data in a loosely ordered way. There are two different usages of the term; one refers...

An abstract graphical data type (AGDT) is an extension of an abstract data type for computer graphics. AGDTs provide the advantages of the ADTs with facilities...

a generalized algebraic data type (GADT, also first-class phantom type, guarded recursive datatype, or equality-qualified type) is a generalization of...

structure about data. Data structures serve as the basis for abstract data types (ADT). The ADT defines the logical form of the data type. The data structure...

especially in type theory and in the description of abstract algorithms, the terms "array" and "array type" sometimes refer to an abstract data type (ADT) also...

In 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 distributed computing, a conflict-free replicated data type (CRDT) is a data structure that is replicated across multiple computers in a network, with...

called transparent. Opaque data types are frequently used to implement abstract data types. Typical examples of opaque data types include handles for resources...

In computer science, peek is an operation on certain abstract data types, specifically sequential collections such as stacks and queues, which returns...

In type theory and functional programming, a stream is a potentially infinite analog of a list, given by the coinductive definition: data Stream α = Nil...

root node. The heap is one maximally efficient implementation of an abstract data type called a priority queue, and in fact, priority queues are often referred...

(example Tree, Heap) Some properties of abstract data types: "Ordered" means that the elements of the data type have some kind of explicit order to them...

Examples of this include: the usage of abstract data types to separate usage from working representations of data within programs; the concept of functions...

array or "abstract array", a theoretical computer science model (an abstract data type or ADT) intended to capture the essential properties of arrays. The...

science, an associative array, map, symbol table, or dictionary is an abstract data type that stores a collection of (key, value) pairs, such that each possible...

A data model is an abstract model that organizes elements of data and standardizes how they relate to one another and to the properties of real-world...

multidictionary) is a generalization of a map or associative array abstract data type in which more than one value may be associated with and returned for...

programming and type theory, an algebraic data type (ADT) is a kind of composite type, i.e., a type formed by combining other types. Two common classes...

paper Chart, a means of representing data (also called a graph) Graph (abstract data type), an abstract data type representing relations or connections...

are organized by abstract data type. As a single concrete data structure may be used to implement many abstract data types, some data structures may appear...

a 2013 novel by Egyptian author Basma Abdel Aziz Queue (abstract data type), a type of data structure in computer science Circular queue Double-ended...