Concepts113
Category
🗂️Data StructureAdvanced
Persistent Segment Tree
A persistent segment tree stores every historical version of an array-like data while supporting queries and updates in O(log n) time.
#persistent segment tree#path copying#kth smallest+12
🗂️Data StructureAdvanced
Treap
A treap is a binary search tree on keys combined with a heap on random priorities, which keeps the tree balanced in expectation.
#treap#randomized bst#fhq treap+12
🗂️Data StructureAdvanced
Segment Tree Beats
Segment Tree Beats is a segment tree variant that supports range chmin/chmax (clamping) together with queries like range sum, min, and max in amortized logarithmic time.
#segment tree beats#range chmin#range chmax+12
🗂️Data StructureAdvanced
Segment Tree - Handling Multiple Lazy Operations
When a segment tree supports multiple range updates, you must define how lazy tags compose, because the order of operations matters and composition is not commutative.
#segment tree#lazy propagation#range add+12
🗂️Data StructureAdvanced
Dynamic Segment Tree
A dynamic segment tree stores values over a huge coordinate range by creating nodes only when an operation touches their interval.
#dynamic segment tree#sparse segment tree#lazy propagation+12