๐๏ธDisjoint Set UnionDisjoint Set Union (Union-Find) is an efficient data structure to track the union of disjoint sets.๐๏ธSegment TreesSegment Trees are used for efficient range queries.๐๏ธSkip ListA comprehensive guide to Skip List, a probabilistic data structure that provides O(log n) search, insertion, and deletion.๐๏ธFenwick TreeFenwick Tree (Binary Indexed Tree) is a more space-efficient data structure for cumulative frequency tables.๐๏ธFibonacci HeapA comprehensive guide to Fibonacci Heap - a heap data structure with amortized O(1) insert and merge operations, used in advanced graph algorithms.๐๏ธSkip ListA comprehensive guide to Skip List - a probabilistic data structure providing O(log n) search, insert, and delete operations.๐๏ธTreapA comprehensive guide to Treap - a randomized BST that combines properties of Binary Search Trees and heaps for self-balancing.๐๏ธSqrt DecompositionSqrt Decomposition is a technique that splits an array into blocks of size sqrt(n) to answer range queries and updates faster than brute force.๐๏ธPersistent Segment TreeA Persistent Segment Tree keeps every previous version of itself accessible after an update, enabling efficient queries on historical states of an array.๐๏ธHeavy-Light DecompositionHeavy-Light Decomposition breaks a tree into chains so that path queries and updates can be answered in O(log^2 n) using a Segment Tree.
๐๏ธDisjoint Set UnionDisjoint Set Union (Union-Find) is an efficient data structure to track the union of disjoint sets.
๐๏ธSkip ListA comprehensive guide to Skip List, a probabilistic data structure that provides O(log n) search, insertion, and deletion.
๐๏ธFenwick TreeFenwick Tree (Binary Indexed Tree) is a more space-efficient data structure for cumulative frequency tables.
๐๏ธFibonacci HeapA comprehensive guide to Fibonacci Heap - a heap data structure with amortized O(1) insert and merge operations, used in advanced graph algorithms.
๐๏ธSkip ListA comprehensive guide to Skip List - a probabilistic data structure providing O(log n) search, insert, and delete operations.
๐๏ธTreapA comprehensive guide to Treap - a randomized BST that combines properties of Binary Search Trees and heaps for self-balancing.
๐๏ธSqrt DecompositionSqrt Decomposition is a technique that splits an array into blocks of size sqrt(n) to answer range queries and updates faster than brute force.
๐๏ธPersistent Segment TreeA Persistent Segment Tree keeps every previous version of itself accessible after an update, enabling efficient queries on historical states of an array.
๐๏ธHeavy-Light DecompositionHeavy-Light Decomposition breaks a tree into chains so that path queries and updates can be answered in O(log^2 n) using a Segment Tree.