From 02465b379bdb3ae49585dd141ca2c1e6784f5c7f Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Fri, 21 Apr 2017 23:27:15 +0300
Subject: [PATCH] Mention special binary indexed trees

---
 chapter09.tex | 5 ++++-
 list.tex      | 5 +++++
 2 files changed, 9 insertions(+), 1 deletion(-)

diff --git a/chapter09.tex b/chapter09.tex
index e19f763..0489037 100644
--- a/chapter09.tex
+++ b/chapter09.tex
@@ -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.
 
diff --git a/list.tex b/list.tex
index fc5214a..170fd94 100644
--- a/list.tex
+++ b/list.tex
@@ -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.