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}
|
||||
|
||||
A segment tree is a binary tree that
|
||||
contains $2n-1$ nodes.
|
||||
The nodes on the bottom level of the tree
|
||||
A segment tree is a binary tree
|
||||
such that the nodes on the bottom level of the tree
|
||||
correspond to the array elements,
|
||||
and the other nodes
|
||||
contain information needed for processing range queries.
|
||||
|
|
Loading…
Reference in New Issue