Interval Problems
← Back to Segment Trees and Fenwick Trees
Segment trees support lazy propagation for range updates (update all elements in [l, r] in O(log n)). Used in competitive programming for interval scheduling, sweep line problems, and 2D range queries.