Skip to content

Segment Tree

Andrew Shepherd edited this page Oct 31, 2024 · 3 revisions

A Segment Tree is a data structure that stores information about array intervals as a tree. This allows answering range queries over an array efficiently, while still being flexible enough to allow quick modification of the array. This includes finding the sum of consecutive array elements.

Problems

Clone this wiki locally