segment tree (tree for range queries) stores aggregate information about array segments, supporting both range queries and point updates in . You use it when you need repeated range queries (sum, min, max) on arrays that also change. Unlike prefix sums which require rebuild after updates, segment trees handle both operations efficiently.
You'll see this in range query problems with updates. If you can explain these concepts in your own words, you'll solve related problems faster under interview pressure.
