Groups
Category
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.
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).