List of data structures

Primitive types

• Boolean, true or false.
• Character
• Floating-point numbers, limited precision rational number values.
  • Including Single precision and Double precision IEEE 754 Floats, among others
• Fixed-point numbers
• Integer, integral or fixed-precision values.
• Reference (also called a pointer or handle), a small value referring to another object's address in memory, possibly a much larger one.
• Enumerated type, a small set of uniquely named values.

Composite types or non-primitive type

• Array
• Record (also called tuple or structure)
• String, a sequence of characters.
• Union
• Tagged union (also called variant, variant record, discriminated union, or disjoint union)

Abstract data types

• Container
• List
• Tuple
• Associative array
• Multimap
• Heap
• Set
• Multiset (bag)
• Stack
• Queue
• Double-ended queue
• Priority queue
• Tree
• Graph

Some properties of abstract data types:

Arrays

• Array
• Bit array
• Bit field
• Bitboard
• Bitmap
• Circular buffer
• Control table
• Image
• Dope vector
• Dynamic array
• Gap buffer
• Hashed array tree
• Heightmap
• Lookup table
• Matrix
• Parallel array
• Sorted array
• Sparse matrix
• Iliffe vector
• Variable-length array

Lists

• Doubly linked list
• Array list
• Linked list
• Self-organizing list
• Skip list
• Unrolled linked list
• VList
• Conc-tree list
• Xor linked list
• Zipper
• Doubly connected edge list also known as half-edge
• Difference list
• Free list

Binary trees

• AA tree
• AVL tree
• Binary search tree
• Binary tree
• Cartesian tree
• Left-child right-sibling binary tree
• Order statistic tree
• Pagoda
• Randomized binary search tree
• Red–black tree
• Rope
• Scapegoat tree
• Self-balancing binary search tree
• Splay tree
• T-tree
• Tango tree
• Threaded binary tree
• Top tree
• Treap
• WAVL tree
• Weight-balanced tree

B-trees

• B-tree
• B+ tree
• B*-tree
• B sharp tree
• Dancing tree
• 2-3 tree
• 2-3-4 tree
• Queap
• Fusion tree
• Bx-tree
• AList

Heaps

• Heap
• Binary heap
• B-heap
• Weak heap
• Binomial heap
• Fibonacci heap
• AF-heap
• Leonardo Heap
• 2-3 heap
• Soft heap
• Pairing heap
• Leftist heap
• Treap
• Beap
• Skew heap
• Ternary heap
• D-ary heap
• Brodal queue

Tries

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

• Trie
• Radix tree
• Suffix tree
• Suffix array
• Compressed suffix array
• FM-index
• Generalised suffix tree
• B-trie
• Judy array
• X-fast trie
• Y-fast trie
• Merkle tree
• Ctrie

Multiway trees

• Ternary tree
• K-ary tree
• And–or tree
• (a,b)-tree
• Link/cut tree
• SPQR-tree
• Spaghetti stack
• Disjoint-set data structure
• Fusion tree
• Enfilade
• Exponential tree
• Fenwick tree
• Van Emde Boas tree
• Rose tree

Space-partitioning trees

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

• Segment tree
• Interval tree
• Range tree
• Bin
• K-d tree
• Implicit k-d tree
• Min/max k-d tree
• Relaxed k-d tree
• Adaptive k-d tree
• Quadtree
• Octree
• Linear octree
• Z-order
• UB-tree
• R-tree
• R+ tree
• R* tree
• Hilbert R-tree
• X-tree
• Metric tree
• Cover tree
• M-tree
• VP-tree
• BK-tree
• Bounding interval hierarchy
• Bounding volume hierarchy
• BSP tree
• Rapidly exploring random tree

Application-specific trees

• Abstract syntax tree
• Parse tree
• Decision tree
• Alternating decision tree
• Minimax tree
• Expectiminimax tree
• Finger tree
• Expression tree
• Log-structured merge-tree
• Lexicographic Search Tree