Line tree and tree array problems supplement

1. Tree height of segment tree:

Here's the n=r-l+1, up to a log2n-1 point.

2. When the interval is queried, only two intervals per floor will be questioned. (A child whose father is completely covered will not be questioned on this level.) ）

3. Total number of nodes in the segment tree

But actually we do the line tree, open the array, only twice times the *n is not enough (this refers to the heap storage of segment tree).

Then we use "construction method" to find the formula of the general term.

Get:

Therefore, at the bottom of the line tree, the maximum number may be close to 4*n, so the segment tree storage space is 4 times times.

4. Interval query

Line tree and tree array problems supplement