Book:Data structures

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Data structures
Btree.svg
This is a Wikipedia book, a collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. For information and help on Wikipedia books in general, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance).
Download PDF ]  [ Download ODT ]  [ Download ZIM ]

Download EPUB ]  [ Open in Book Creator ]  [ Order Printed Book ]

[ About ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ]

Data structures[edit]

Introduction
Data structures
Linked data structure
Succinct data structure
Implicit data structure
Compressed data structure
Search data structure
Persistent data structure
Concurrent data structure
Abstract data types
Abstract data type
List
Stack
Queue
Deque
Priority queue
Map
Bidirectional map
Multimap
Set
Tree
Arrays
Array data structure
Row-major order
Dope vector
Iliffe vector
Dynamic array
Hashed array tree
Gap buffer
Circular buffer
Sparse array
Bit array
Bitboard
Parallel array
Lookup table
Lists
Linked list
XOR linked list
Unrolled linked list
VList
Skip list
Self-organizing list
Binary trees
Binary tree
Binary search tree
Self-balancing binary search tree
Tree rotation
Weight-balanced tree
Threaded binary tree
AVL tree
Red-black tree
AA tree
Scapegoat tree
Splay tree
T-tree
Rope
Top Trees
Tango tree
Van Emde Boas tree
Cartesian tree
Treap
B-trees
B-tree
B+ tree
Dancing tree
2-3 tree
2-3-4 tree
Queaps
Fusion tree
Bx-tree
Heaps
Heap
Binary heap
Binomial heap
Fibonacci heap
2-3 heap
Pairing heap
Beap
Leftist tree
Skew heap
Soft heap
D-ary heap
Tries
Trie
Radix tree
Suffix tree
Suffix array
Compressed suffix array
FM-index
Generalized suffix tree
B-trie
Judy array
Ctrie
Directed acyclic word graph
Multiway trees
Ternary search tree
And–or tree
(a,b)-tree
Link/cut tree
SPQR tree
Spaghetti stack
Disjoint-set data structure
Space-partitioning trees
Space partitioning
Binary space partitioning
Segment tree
Interval tree
Range tree
Bin
K-d tree
Implicit k-d tree
Min/max kd-tree
Adaptive k-d tree
Quadtree
Octree
Linear octrees
Z-order curve
UB-tree
R-tree
R+ tree
R* tree
Hilbert R-tree
X-tree
Metric tree
Vp-tree
BK-tree
Hashes
Hash table
Hash function
Open addressing
Lazy deletion
Linear probing
Quadratic probing
Double hashing
Cuckoo hashing
Coalesced hashing
Perfect hash function
Universal hashing
Linear hashing
Extendible hashing
2-choice hashing
Pearson hashing
Fowler–Noll–Vo hash function
Bitstate hashing
Bloom filter
Locality preserving hashing
Zobrist hashing
Rolling hash
Hash list
Hash tree
Prefix hash tree
Hash trie
Hash array mapped trie
Distributed hash table
Consistent hashing
Stable hashing
Koorde
Graphs
Graph
Adjacency list
Adjacency matrix
And-inverter graph
Binary decision diagram
Binary moment diagram
Zero-suppressed decision diagram
Propositional directed acyclic graph
Graph-structured stack
Scene graph
Appendix
Big O notation
Amortized analysis
Locality of reference
Standard Template Library