User:Shahaan09/Books/Data structures (Trees)

Data structures

 * Tree (data structure)
 * Abstract syntax tree
 * Adaptive k-d tree
 * Anatree
 * And–or tree
 * Ball tree
 * Binary space partitioning
 * BK-tree
 * Bounding interval hierarchy
 * Branching factor
 * C-trie
 * Calkin–Wilf tree
 * Cover tree
 * Dendrogram
 * Descendant tree (group theory)
 * Dialog tree
 * Doubly logarithmic tree
 * Embedded Zerotrees of Wavelet transforms
 * Enfilade (Xanadu)
 * Expectiminimax tree
 * Exponential tree
 * Fenwick tree
 * Figurative system of human knowledge
 * Finger search tree
 * Finger tree
 * Fractal tree index
 * Fusion tree
 * Generalized suffix tree
 * GiST
 * H tree
 * Hash calendar
 * Hash trie
 * HAT-trie
 * Hyperbolic tree
 * Iacono's working set structure
 * Implicit k-d tree
 * Infinite tree automaton
 * K-ary tree
 * K-d tree
 * K-D-B-tree
 * Left rotation
 * Leftist tree
 * Linear octree
 * Link/cut tree
 * Log-structured merge-tree
 * M-tree
 * Merkle tree
 * Metric tree
 * Min/max kd-tree
 * Newick format
 * Octree
 * Parse tree
 * Pebble automaton
 * Phylogenetic tree
 * Polychotomous key
 * PQ tree
 * Prediction Suffix Tree
 * Prefix order
 * Program structure tree
 * Quadtree
 * Radial tree
 * Radix tree
 * Range tree
 * Rose tree
 * Segment tree
 * Self-balancing binary search tree
 * Semantic resolution tree
 * Sentinel node
 * Sentinel value
 * Split (phylogenetics)
 * SPQR tree
 * Stern–Brocot tree
 * Suffix tree
 * Suffix tree clustering
 * T-theory
 * Ternary search tree
 * Ternary tree
 * Trace tree
 * Tree (automata theory)
 * Tree accumulation
 * Tree automaton
 * Tree homomorphism
 * Tree network
 * Tree of primitive Pythagorean triples
 * Tree rearrangement
 * Tree structure
 * Tree traversal
 * Tree walking automaton
 * Treemapping
 * Trie
 * Trinomial tree
 * Vantage-point tree
 * Wavelet Tree
 * X-fast trie
 * Y-fast trie
 * Data structure
 * List of data structures
 * Array data structure
 * Binary tree
 * Calendar queue in simulation
 * Collection (abstract data type)
 * Compressed data structure
 * Concurrent data structure
 * Conflict-free replicated data type
 * Container (abstract data type)
 * Control table
 * Data descriptor
 * Device tree
 * Disjoint-set data structure
 * Distance oracle
 * Doubly linked face list
 * Dynamic connectivity
 * Dynamization
 * Finger search
 * Flexible array member
 * Hash table
 * I/O request packet
 * Implicit data structure
 * Inversion list
 * Java collections framework
 * Java ConcurrentMap
 * Key-independent optimality
 * Linked data structure
 * Linked list
 * Node (computer science)
 * Oblivious data structure
 * Order-maintenance problem
 * Parent pointer tree
 * Partition refinement
 * Persistent data structure
 * Piece table
 * Process Environment Block
 * Processor Control Region
 * Randomized meldable heap
 * Recordset
 * Retroactive data structures
 * User:RyeTheCat/sandbox
 * Search data structure
 * Search tree
 * Sequential access
 * Serialization
 * Set intersection oracle
 * Sorted array
 * Succinct data structure
 * Symbol table
 * Synonym (database)
 * Term indexing
 * Zipper (data structure)


 * Introduction
 * Data structure
 * 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