Range trees: Fixed complexity of RangeQuery in the summary

07-geom/geom.tex

@@ -325,7 +325,7 @@ for all rebalancing of the constituent 1-d trees. The same argument applies to
 Let us summarize time complexity of all operations:
 \optable{
 	\op{Build}	&$\O(n\log^{d-1} n)$ \cr
-	\op{RangeQuery}	&$\O(n\log^d n + p)$ for $p$~reported points \cr
+	\op{RangeQuery}	&$\O(\log^d n + p)$ for $p$~reported points \cr
 	\op{Insert}	&$\O(\log^d n)$ amortized \cr
 	\op{Delete}	&$\O(\log^d n)$ amortized \cr
 }