bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Mention special binary indexed trees

This commit is contained in:
Antti H S Laaksonen 2017-04-21 23:27:15 +03:00
parent 35d6a58004
commit 02465b379b
2 changed files with 9 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
chapter09.tex
View File

@ -759,7 +759,10 @@ Compared to a binary indexed tree,
the advantage of a segment tree is that it is
a more general data structure.
While binary indexed trees only support
sum queries, segment trees also support other queries.
sum queries\footnote{In fact, using \emph{two} binary
indexed trees it is possible to support minimum queries \cite{dim15},
but this is more complicated than to use a segment tree.},
segment trees also support other queries.
On the other hand, a segment tree requires more
memory and is a bit more difficult to implement.

5
list.tex
View File

@ -86,6 +86,11 @@
% Some theorems on abstract graphs.
% \emph{Proceedings of the London Mathematical Society}, 3(1):69--81, 1952.
\bibitem{dim15}
M. Dima and R. Ceterchi.
Efficient range minimum queries using binary indexed trees.
\emph{Olympiad in Informatics}, 9(1):39--44, 2015.
\bibitem{edm65}
J. Edmonds.
Paths, trees, and flowers.