List of data structures

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

This is a list of data structures. For a wider list of terms, see list of terms relating to algorithms and data structures. For a comparison of running time of subset of this list see comparison of data structures.

Data types[edit]

Primitive types[edit]

Composite types[edit]

(Sometimes also referred to as Plain old data structures.)

Abstract data types[edit]

Some properties of abstract data types:

Structure Stable Unique Cells per Node
Bag (multiset) no no 1
Set no yes 1
List yes no 1
Map no yes 2

"Stable" means that input order is retained.

Other structures such as "linked list" and "stack" cannot easily be defined this way because there are specific operations associated with them.

Linear data structures[edit]

Arrays[edit]

Lists[edit]

Trees[edit]

Main article: Tree (data structure)

Binary trees[edit]

B-trees[edit]

Heaps[edit]

Tries[edit]

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

Multiway trees[edit]

Space-partitioning trees[edit]

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

Application-specific trees[edit]

Hashes[edit]

Graphs[edit]

Other[edit]