User:Abhishekworld/Books/DataStructures

Data structures

 * Introduction
 * Data structure


 * Abstract data types
 * Abstract data type
 * List
 * Stack
 * Queue
 * Deque
 * Priority queue
 * Map
 * Bidirectional map
 * Multimap
 * Set
 * Tree


 * Arrays
 * Array
 * Row-major order
 * Dope vector
 * Iliffe vector
 * Dynamic array
 * Hashed array tree
 * Gap buffer
 * Circular buffer
 * Sparse array
 * Bit array
 * Hamming weight
 * 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
 * Randomized 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


 * B-trees
 * B-tree
 * B+ tree
 * B*-tree
 * B sharp tree
 * Dancing tree
 * 2-3 tree
 * 2-3-4 tree
 * Fusion tree
 * Bx-tree


 * Heaps
 * Heap
 * Binary heap
 * Binomial heap
 * Fibonacci heap
 * 2-3 heap
 * Pairing heap
 * Treap
 * Beap
 * Leftist tree
 * Skew heap
 * Soft heap
 * Ternary heap
 * D-ary heap


 * Tries
 * Trie
 * Radix tree
 * Suffix tree
 * Suffix array
 * FM-index
 * Generalised suffix tree
 * B-trie
 * Judy array


 * 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
 * Kd-trie
 * 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
 * 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
 * Propositional directed acyclic graph


 * Appendix
 * Big O notation
 * Amortized analysis
 * Locality of reference
 * Standard Template Library