1.6 List of Data Structures

Tables 1.1 and 1.2 summarizes the performance of data structures in this book that implement each of the interfaces, List, USet, and SSet, described in Section 1.1. Figure 1.6 shows the dependencies between various chapters in this book. A dashed arrow indicates only a weak-dependency, in which only a small part of the chapter depends on a previous chapter or only the main results of the previous chapter.


Table 1.1: Summary of List and USet implementations.

\begin{threeparttable}
% latex2html id marker 2072\begin{tabular}{\vert l\vert...
...]{Denotes an \emph{expected} running time.}
\end{tablenotes}\end{threeparttable}



Table 1.2: Summary of SSet and priority Queue implementations.

\begin{threeparttable}
% latex2html id marker 2160\begin{tabular}{\vert l\vert...
...emory model; see Chapter~\ref{chap:btree}.}
\end{tablenotes}\end{threeparttable}


Figure 1.6: The dependencies between chapters in this book.
\includegraphics[width=.95\textwidth]{figs/dependencies}



opendatastructures.org