Typically the range query function of segment tree looks like

```
int query(i, j, low, high, pos){
//some code
if(i <= low and j <= high){
return ST[pos]
}
//some more code
```

}

I want to know, in worst case, how many times the line “return ST[pos]” would get executed. In other words, what is the maximum number of nodes required to represent a sub-array fully in a segment tree.

Please do not forget to justify your answer.