TODO revision

02-splay/splay.tex

@@ -600,8 +600,6 @@ As the absolute value of the potential is always $\O(n\log n)$, so is the potent
 
 The working set property makes Splay tree a~good candidate for various kinds of caches.
 
-\subsection{Representing a~trie}
-
-TODO
+% \subsection{Representing a~trie}
 
 \endchapter

03-abtree/abtree.tex

@@ -345,16 +345,12 @@ is non-negative and initially zero, this guarantees that the total real cost of
 operations is $\O(m)$.
 \qed
 
-\subsection{A-sort}
-
-TODO
+% \subsection{A-sort}
 
 \section{Top-down (a,b)-trees and parallel access}
 
 TODO
 
-\section{Red-black trees}
-
-TODO
+% \section{Red-black trees}
 
 \endchapter

06-hash/hash.tex

@@ -751,7 +751,7 @@ Since the last sum converges for an arbitrary $q\in(0,1)$, the expectation of~$\
 is at most a~constant. This concludes the proof of the theorem.
 \qed
 
-TODO: Concentration inequalities and 5-independence.
+% TODO: Concentration inequalities and 5-independence.
 
 \section{Bloom filters}
 

TODO

+Splay trees:
+
+  - Representing a trie
+
+(a,b)-trees:
+
+  - A-sort
+  * top-down access
+  - Red-black trees
+
+Heaps:
+
+  * Dijkstra
+  * regular heaps
+
+Caching:
+
+  - searching
+  - HW caches
+
+Geometric:
+
+  * k-d trees
+  * range trees