A segment tree is a tree data structure that allows aggregation queries and updates over array intervals in logarithmic time. As I see it, there are three major use cases for segment trees:

**Static segment trees:**This is probably the most common use case. We preprocess an array of N elements to construct a segment tree in O(N). Now, we can query aggregates over any arbitrary range/segment of the array in O(log N).**Segment tree with point updates:**This allows us to update array values, one at a time in O(log N), while still maintaining the segment tree structure. Queries over any arbitrary range still occurs in O(log N).**Segment tree with range updates:**This allows us to update a range of array elements at once in O(N) in the worst case, however problem specific optimizations and lazy propagation typically give huge improvements. Queries over any arbitrary range still occurs in O(log N).

In this post, I’ll cover the first two use cases because they go together. Given a static segment tree, it is very easy to add point update capability to it. I’ll leave the third use case as the subject matter of a future blog post. I intend this post to be a practical introduction to segment trees, rather than a theoretical description, so it will focus on how we can divide a segment tree into its components, the working of each component and how we can separate the problem specific logic from the underlying data structure. We’ll build a template for a segment tree and then apply it to several problems to understand how problem specific logic can be cleanly separated from the template.

**Structure of a segment tree**

Let’s understand what a segment tree looks like. Each node in a segment tree stores aggregate statistics for some range/segment of an array. The leaf nodes stores aggregate statistics for individual array elements. Although a segment tree is a tree, it is stored in an array similar to a heap. If the input array had 2^{n} elements (i.e., the number of elements were a power of 2), then the segment tree over it would look something like this:

Each node here shows the segment of the input array for which it is responsible. The number outside a node indicates its index in the segment tree array. Clearly, if the array size N were a power of 2, then the segment tree would have 2*N-1 nodes. It is simpler to store the first node at index 1 in the segment tree array in order to simplify the process of finding indices of left and right children (a node at index i has left and right children at 2*i and 2*i+1 respectively). Thus, for an input array of size N, an array of size 2*N would be required to store the segment tree.

In practice, however, N is not usually a power of 2, so we have to find the power of 2 immediately greater than N, let’s call it x, and allocate an array of size 2*x to store the segment tree. The following procedure calculates the size of array required to store a segment tree for an input array size N:

We’ll try to separate the implementation of the underlying data structure from the problem specific logic. For this purpose, let us define a structure for a segment tree node:

**Building a segment tree**

We can build a segment tree recursively in a depth first manner, starting at the root node (representative of the whole input array), working our way towards the leaves (representatives of individual input array elements). Once both children of a node have returned, we can merge their aggregate statistics to form their parent node.

Here I’ve assumed that the type of input array elements is T. stIndex represents the index of current segment tree node in the segment tree array, lo and hi indicate the range/segment of input array this node is responsible for. We build the whole segment tree with a single call to buildTree(arr, 1, 0, N-1), where N is the size of input array arr. Clearly, the time complexity of this procedure is O(N), assuming that assignLeaf() and merge() operations work in O(1).

**Querying the segment tree**

Suppose we want to query the aggregate statistic associated with the segment [lo,hi], we can do this recursively as follows:

This procedure is similar to the one used for building the segment tree, except that we cut off recursion when we reach a desired segment. The complexity of this procedure is O(log N).

**Updating the segment tree **

The above two procedures, building the segment tree and querying it, are sufficient for the first use case: a static segment tree. It so happens that the second use case: point updates, doesn’t require many changes. In fact, we don’t have to change the problem specific logic at all. No changes in the structure SegmentTreeNode are required.

We just need to add in a procedure for updating the segment tree. It is very similar to the buildTree() procedure, the only difference being that it follows only one path down the tree (the one that leads to the leaf node being updated) and comes back up, recursively updating parent nodes along this same path.

Clearly, the complexity of this operation is O(log N), assuming that assignLeaf() and merge() work in O(1).

**Segment Tree template**

Let’s put all this together to complete the template for a segment tree.

We shall now see how this template can be used to solve different problems, without requiring a change in the tree implementation, and how the structure SegmentTreeNode is implemented differently for different problems.

The **first problem** we’ll look at it is GSS1. This problem asks for a solution to maximum subarray problem for each range of an array. My objective here is not to explain how to solve this problem, rather to demonstrate how easily it can be implemented with the above template at hand.

As it turns out, we need to store 4 values in each segment tree node to be able to merge child nodes to form a solution to their parent’s node:

- Maximum sum of a subarray, starting at the leftmost index of this range
- Maximum sum of a subarray, ending at the rightmost index of this range
- Maximum sum of any subarray in this range
- Sum of all elements in this range

The SegmentTreeNode for this problem looks as follows:

The complete solution for this problem can be viewed here.

The **second problem** we’ll look at is GSS3, which is very similar to GSS1 with the only difference being that it also asks for updates to array elements, while still maintaining the structure for getting maximum subarray sum. Now, we can understand the advantage of separating problem specific logic from the segment tree implementation. This problem requires no changes to the template and even uses the same SegmentTreeNode as used for GSS1. The complete solution for this problem can be viewed here.

The **third problem**: BRCKTS, we’ll look at is very different from the first two but the differences are only superficial since we’ll be able to solve it using the same structure. This problem gives a string containing parenthesis (open and closed), requires making updates to individual parenthesis (changing an open parenthesis to closed or vice versa), and checking if the whole string represents a correct parenthesization.

As it turns out, we need only 2 things in each segment tree node:

- The number of unmatched open parenthesis in this range
- The number of unmatched closed parenthesis in this range

The SegmentTreeNode for this problem looks as follows:

The complete solution for this problem can be viewed here.

The **final problem** we’ll look at in this post is KGSS. This problem asks for the maximum pair sum in each subarray and also requires updates to individual array elements. As it turns out, we only need to store 2 things in each segment tree node:

- The maximum value in this range
- The second maximum value in this range

The SegmentTreeNode for this problem looks as follows:

The complete solution for this problem can be viewed here.

I hope this post presented a gentle introduction to segment trees and I look forward to feedback for possible improvements and suggestions for a future post on segment trees with lazy propagation.

Continue to Part 2…

Thanks bro

Hey Kartik – great article.

Question – Why do you input “left, right” as parameters to the query and update methods?

Wouldn’t it be more encapsulated to put them inside SegmentTreeNode on buildTree?

I created a python version of your ST, and in buildTree I’m doing:

st[st_index] = {“s”: arr_start, “e”: arr_end, “v”: v}

So query and update have less parameters to move around (also less code duplication). What’s the disadvantages of this approach?

Yeah, that’s a good alternative. I was just trying to separate the problem specific code in SegmentTreeNode from the problem invariant data structure implementation in SegmentTree. There isn’t much code duplication. Even if we use a structure to represent the arguments, they still are different for each method call but I agree, it’d be more elegant this way. There are no disadvantages, it’s mostly a matter of choice.

thanks! btw, all your help still didn’t help me to beat KGSS on SPOJ. Probably time limits are set with C++ in mind… But I did learn the principle🙂

Very good tutorial especially for absolute beginners. Best i found anywhere. Just need a few more pointers on how to maintain node where pre-processing on array is required…for example: http://www.spoj.com/problems/DQUERY/en/

Since the problem-specific logic is separated out from the tree implementation, you can be as creative with how your input is represented as you want. In this problem, I believe we need to maintain the index of each element in sorted order. You can build the segment tree over the array of these indices. Basically you can do whatever preprocessing you want and build the segment tree over its output.

Great Article!!

Great Article

Hey Kartik, thanks for the great article. One of the best articles explaining segTrees. I learnt the basic structure of segTree. Thanks a lot.🙂

For GSS1, I have a problem specific question. How do you decide on the values the nodes need to store to be able to merge children?

( 4 values in this case :

1. Maximum sum of a subarray, starting at the leftmost index of this range

2. Maximum sum of a subarray, ending at the rightmost index of this range

3. Maximum sum of any subarray in this range

4. Sum of all elements in this range.

)

That’s the entire problem solving logic, isn’t it? You have to understand the problem and decide what all you need to store in each node so that you can compute those values for a node by using only the values of its children nodes. For this problem, we want only (3) maximum sum of any subarray in this range, but to be able to compute this from children values, we need to introduce (1) prefixMaxSum and (2) suffixMaxSum. Then, to be able to compute (1) and (2), we also need to store (4) sum. So we can take a top-down approach from what we want to what we need to compute that.

Hey I guess you have to use return size; in getSegmentTreeSize function

No. Please read the text before the getSegmentTreeSize() function. In short, if we want to create segment tree over N elements and N is a power of 2, we need 2*N-1 nodes in the segment tree. If N is not a power of 2, we need 2*x-1 nodes, where x is the power of 2 immediately greater than N. To simplify implementation, we are ignoring the first node and using 1-based indexing so we need 2*x nodes. I hope that answers your concern.

Hi Kartik. Thank you for the excellent explanation on Segment trees.

There is one thing I wanted to clarify in the application to GSS1 where we are computing the merge.

Lets say we have 2 intervals [a,b] and [c,d]

Could I say, that another way of writing maxSum would be

max( a, b, c, d, [a-b], [b-c], [c-d], [a-c], [b-d] and [a-d])?

So the earlier prefixMaxSum and suffixMaxSum and their combinations handle cases for certain combinations of the above set ranges?

Thanks very much.

Please define what do you mean by max of a range [a-b]?

I tried leaving a comment, but it didnt appear here when I clicked “Post Comment”. So, sorry if this is a duplicate.

Let’s say the Left node is interval [a-b] and the right node is interval [b-c]

Can I say that prefixMax sum is equivalent to max of ([a], [a-b], [a-c])

Can I say that postfixMax sum is equivalent to max of ([b-d], [c-d], [d])

and maxSum is

max of ([a], [b], [c], [d], [a-b], [b-c], [c-d], [a-c], [b-d], [a-d]) ?

What do you mean by max of a range [a-b]? Maximum element in that range? Then, no. PrefixMaxSum of a range [a-b] is the maximum sum of a prefix of that interval i.e., sum([a,x]) where a <= x = sum([a,y]) where a <= x < y <= b.

I meant it exactly the way you have meant it.

For prefix sum – max of the ranges starting at a

for suffix sum max of the ranges ending at d.

The notation does not indicate that. If you read max([a], [a-b], [a-c]), you wouldn’t know what it should mean? what does [a] mean btw?

I am getting where Im going wrong. Since since the range [a-a] is contained in the range [a-b] and in this particular case, I should have said PrefixMaxSum [a-b] there is no need to mention [a] again. What I was trying to do was relate PrefixMaxSum/SuffixMaxSum to the primitive intervals [a-b] and [c-d] that are going to make up the new range [a-d].

Great article Kartik. It helped me a lot. Thanks. Keep up the good work.

Great explanation, thanks! Inspired by your post I wrote a version that stores all data in the segment node class rather than in a separate array, as I find it easier to comprehend this way. Maybe you’d be interested: http://allanrbo.blogspot.com/2016/03/segment-tree-implementation-in-java.html

How do I find sum of all subsets of a range in an array?

Given an array A of N elements and Q queries of type [ l, r ]. Print the sum of each subset in the range { A[l], A[r] }.

For example: A[]= { 1, 2, 3, 4 } and [ l,r ]= [ 1, 3 ] then

print sum( 1 ), sum ( 2 ), sum( 3 ), sum( 1,2 ), sum( 1,3 ), sum( 2,3 ), sum( 1,2,3 )

I think I’ve got it but do verify. I’ve made an assumption which I think would be part of the problem specification: The array A[] has distinct elements.

Each segment tree node will need to store only 1 thing: sum of all subsets in that segment. The size of a segment can be calculated from its range and need not be stored.

For leaf nodes, the value is simply the element itself. For any internal node, we combine the values of the two children segments, having sizes x and y, and values a and b respectively, as follows:

a*2^y + b*2^x

I think that should do it.

Thanks a lot! Nice Tutorial !!

I think the sizeofsegmenttree function should return size, because when I am giving input 10 it returns 32 while it should return 32/2 and it is also true in general.

No. It should return 32. Size of segment tree is not the next power of 2 but twice that. Please look at this comment: https://kartikkukreja.wordpress.com/2014/11/09/a-simple-approach-to-segment-trees/comment-page-2/#comment-6222

best article on segment tree😀

Thank you

In the third problem BRCKTS. Can I represent ‘(‘ as -1, ‘)’ as 1, then in the segment tree node I store a sum of the current range, then if the sum value of the root node is 0, it shows that the bracket is correct. Is it correct? I got WA. But I did not where is wrong in this idea.

Addition on integers is symmetric but concatenation on brackets is not. -1 + 1 or 1 + -1 are both 0, but () is balanced and )( is not.