List of data structures

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

This 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 times for a subset of this list see comparison of data structures.

Data types[edit]

Primitive types[edit]

Composite types or non-primitive type[edit]

Abstract data types[edit]

Some properties of abstract data types:

Structure Order Unique
List yes no
Associative array no keys (indexes) only
Set no yes
Stack yes no
Multimap no no
Multiset (bag) no no
Queue yes no

Order means the insertion sequence counts. Unique means that duplicate elements are not allowed, based on some inbuilt or, alternatively, user-defined rule for comparing elements.

Linear data structures[edit]

A data structure is said to be linear if its elements form a sequence.




Trees are a subset of directed acyclic graphs.

Binary trees[edit]



Bit-slice trees[edit]

In these data structures each tree node compares a bit slice of key values.

Multi-way trees[edit]

Space-partitioning trees[edit]

These are data structures used for space partitioning or binary space partitioning.

Application-specific trees[edit]

Hash-based structures[edit]


Many graph-based data structures are used in computer science and related fields:


See also[edit]

External links[edit]