Summary of the Segment Tree Data Structure
Consider we have n points indexed from 1 to n, each storing a numeric value. We often need to perform updates or aggregate queries over the continuous subrange [L, R]. The segment tree enables both update and query operations in O(log n) time complexity. The core idea of a segment tree is to recursi...