User:Budgerigar/Books/Data Structures

Data Structures

Data types

Primitive types

Primitive data type

Boolean data type

Character (computing)

Floating-point arithmetic

Double-precision floating-point format

Integer (computer science)

String (computer science)

Reference (computer science)

Enumerated type

Composite data type

Composite types

Array data type

Record (computer science)

Union type

Tagged union

Abstract data types

Abstract data type

Container (abstract data type)

List (abstract data type)

Associative array

Multimap

Set (abstract data type)

Multiset

Stack (abstract data type)

Queue (abstract data type)

Double-ended queue

Priority queue

Tree (data structure)

Linear data structures

Arrays

Array data structure

Bit array

Bit field

Bitboard

Bitmap

Circular buffer

Control table

System image

Dope vector

Gap buffer

Hashed array tree

Heightmap

Lookup table

Matrix (mathematics)

Parallel array

Sorted array

Iliffe vector

Variable-length array

Lists

Doubly linked list

Dynamic array

Linked list

Self-organizing list

Skip list

Unrolled linked list

Conc-Tree list

XOR linked list

Zipper (data structure)

Doubly connected edge list

Difference list

Free list

Trees

Binary trees

AA tree

AVL tree

Binary search tree

Binary tree

Cartesian tree

Left-child right-sibling binary tree

Order statistic tree

Pagoda (data structure)

Red–black tree

Rope (data structure)

Scapegoat tree

Self-balancing binary search tree

Splay tree

T-tree

Tango tree

Threaded binary tree

Top tree

WAVL tree

Weight-balanced tree

B-trees

B-tree

B+ tree

Dancing tree

2–3 tree

2–3–4 tree

Queap

Fusion tree

Bx-tree

Heaps

Heap (data structure)

Binary heap

Weak heap

Binomial heap

Fibonacci heap

AF-heap

Smoothsort

2–3 heap

Soft heap

Pairing heap

Leftist tree

Treap

Beap

Skew heap

D-ary heap

Brodal queue

Trees

Trie

Radix tree

Suffix tree

Suffix array

Compressed suffix array

FM-index

Generalized suffix tree

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

Parent pointer tree

Disjoint-set data structure

Enfilade (Xanadu)

Exponential tree

Fenwick tree

Van Emde Boas tree

Rose tree

Space-partitioning trees

Segment tree

Interval tree

Range tree

Bin (computational geometry)

K-d tree

Implicit k-d tree

Min/max kd-tree

Relaxed k-d tree

Adaptive k-d tree

Quadtree

Octree

Linear octree

Z-order curve

UB-tree

R-tree

R+ tree

R* tree

Hilbert R-tree

X-tree

Metric tree

Cover tree

M-tree

Vantage-point tree

BK-tree

Bounding interval hierarchy

Bounding volume hierarchy

Binary space partitioning

Rapidly-exploring random tree

Application-specific trees

Abstract syntax tree

Parse tree

Decision tree

Minimax

Expectiminimax tree

Finger tree

Binary expression tree

Log-structured merge-tree

Hashes

Bloom filter

Count–min sketch

Distributed hash table

Double hashing

Dynamic perfect hashing

Hash array mapped trie

Hash list

Hash table

Hash tree

Hash trie

Koorde

Prefix hash tree

Rolling hash

MinHash

Quotient filter

Graphs

Graph (abstract data type)

Adjacency list

Adjacency matrix

Graph-structured stack

Scene graph

Binary decision diagram

Zero-suppressed decision diagram

And-inverter graph

Directed graph

Directed acyclic graph

Propositional directed acyclic graph

Multigraph

Hypergraph

Other

Lightmap

Winged edge

Quad-edge

Routing table

Symbol table