Concepts3
🗂️Data StructureIntermediate
Iterative Segment Tree
An iterative segment tree stores all leaves in tree[n..2n-1] and internal nodes in tree[1..n-1], enabling O(\log n) point updates and range queries without recursion.
#iterative segment tree#segment tree#non-recursive+12
🗂️Data StructureIntermediate
Segment Tree Basics
A segment tree is a complete binary tree that stores information about array intervals to answer range queries and support point updates in O(log n).
#segment tree#range query#point update+11
🗂️Data StructureIntermediate
Sparse Table
A Sparse Table is a static range-query data structure that preprocesses an array in O(n \log n) time and answers many queries in O(1) time.
#sparse table#range minimum query#rmq+12