A Segment Tree is a data structure used to handle various range query problems efficiently. It is particularly useful in scenarios where we need to perform multiple range queries and updates on an array.

Segment Trees help in reducing the time complexity for range queries. Traditional methods might require O(n) time, but Segment Trees can handle these operations in O(\log n) time.

Imagine you have an array [2, 4, 6, 8, 10, 12] and need to find the sum of elements in the range [1, 3] frequently