 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Data structures
edit- Introduction
- Data structure
- Linked data structure
- Succinct data structure
- Implicit data structure
- Compressed data structure
- Search data structure
- Static and dynamic data structures
- 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 field
- Bit array
- Bitboard
- Parallel array
- Lookup table
- Lists
- Linked list
- XOR linked list
- Unrolled linked list
- VList
- Skip list
- Jump 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 Trees
- Van Emde Boas tree
- Cartesian tree
- Treap
- B-trees
- B-tree
- B+ tree
- B*-tree
- B sharp 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
- Ternary heap
- D-ary heap
- Tries
- Trie
- Radix tree
- Suffix tree
- Suffix array
- Compressed suffix array
- FM-index
- Generalised suffix tree
- B-trie
- Judy array
- 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
- Kd-tree
- Implicit kd-tree
- Min/max kd-tree
- Adaptive k-d tree
- Quadtree
- Octree
- Linear octrees
- Z-order
- 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
- Morton number
- 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