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.

Contents

[edit] Data types

[edit] Primitive types

[edit] Composite types

[edit] Abstract data types

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.

[edit] Linear data structures

[edit] Arrays

[edit] Lists

[edit] Trees

[edit] Binary trees

[edit] B-trees

[edit] Heaps

[edit] Tries

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

[edit] Multiway trees

[edit] Space-partitioning trees

This is data structures used for space partitioning or binary space partitioning.

[edit] Application specific trees

[edit] Hashes

[edit] Graphs

Personal tools