ALGORITHMS

Given a list of elements Segment Tree can find out any information of a segment/part of the list. As an example, given an array [8, 7, 3, 9, 5, 1, 10] you are asked to find sum of elements between between 2nd and 5th element (index starts from 0, including boundary). Answer is 18.

Operations
...

Continue reading...