Next: The Graph Hierarchy
Up: Algorithms
Previous: BinomialHeap
The general dictionary structures allow random access like Containers but allow distinct lookup keys like the priority queue classes. Theses
classes now include BinarySearchTree and RedBlackTree, though
neither has been well tested or documented.
Figure 2.15:
BinarySearchTree
![\begin{figure}
\begin{flushleft}
\begin{minipage}[t]
{\textwidth}
\hrulefill
\v...
...nd{verbatim}
\vspace*{-6mm}
\hrulefill\end{minipage}\end{flushleft}\end{figure}](img60.gif) |
The examples in Figures
and
illustrate the use of general dictionary classes.
However, these classes should be used only with caution and the
expectation that bugs may exist. As with any LINK problem, please report
these problems to Jonathan Berry at berryj@dimacs.rutgers.edu
.
Figure 2.16:
RedBlackTree
![\begin{figure}
\begin{flushleft}
\begin{minipage}[t]
{\textwidth}
\hrulefill
\v...
...nd{verbatim}
\vspace*{-6mm}
\hrulefill\end{minipage}\end{flushleft}\end{figure}](img61.gif) |
RHS Linux User
1/26/1998