List of data structures

Summary

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 typesEdit

Primitive typesEdit

Composite types or non-primitive typeEdit

Abstract data typesEdit

Some properties of abstract data types:

Structure Order Unique
List yes[dubious ] 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 structuresEdit

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

ArraysEdit

ListsEdit

TreesEdit

Trees are a subset of directed acyclic graphs.

Binary treesEdit

B-treesEdit

HeapsEdit

Bit-slice treesEdit

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

Multi-way treesEdit

Space-partitioning treesEdit

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

Application-specific treesEdit

Hash-based structuresEdit

GraphsEdit

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

OtherEdit

See alsoEdit


External linksEdit

  • Tommy Benchmarks Comparison of several data structures.