Category
page 1Abstract data types
stack
abstract data type
queue
abstract data type
tree
abstract data type
abstract data type
mathematical model for data types
associative array
data type that associates keys with values
list
abstract data type used in computer science
graph data structure
abstract data type in computer science
set
abstract data type in computer science
iterator
In computer programming, an iterator is an object that progressively provides access to each item of a collection, in order.
container
software class, data structure, or abstract data type (ADT) whose instances are collections of other objects
priority queue
abstract data type in computer science
double-ended queue
abstract data type for which elements can be added to or removed from either the front or back
collection
data type in computer science
multimap
In computer science, a multimap (sometimes also multihash, multidict or 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 a given key. Both map and multimap are particular cases of containers (for example, see C++ Standard Template Library containers). Often the multimap is implemented as a map with lists or sets as the map values.
double-ended priority queue
abstract data structure that supports removal of maximum- and minimum-priority elements