Better definition for segment trees
This commit is contained in:
parent
98fda0b259
commit
5182b44f31
|
@ -759,9 +759,8 @@ memory and is a bit more difficult to implement.
|
||||||
|
|
||||||
\subsubsection{Structure}
|
\subsubsection{Structure}
|
||||||
|
|
||||||
A segment tree is a binary tree that
|
A segment tree is a binary tree
|
||||||
contains $2n-1$ nodes.
|
such that the nodes on the bottom level of the tree
|
||||||
The nodes on the bottom level of the tree
|
|
||||||
correspond to the array elements,
|
correspond to the array elements,
|
||||||
and the other nodes
|
and the other nodes
|
||||||
contain information needed for processing range queries.
|
contain information needed for processing range queries.
|
||||||
|
|
Loading…
Reference in New Issue