Concepts2
🗂️Data StructureAdvanced
Segment Tree with Range Affine Transformation
A segment tree with lazy propagation can support range updates of the form x → a·x + b (affine transformations) and range-sum queries in O(log n) per operation.
#segment tree#lazy propagation#affine update+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