Next: The Graph Hierarchy Up: Algorithms Previous: BinomialHeap

## General Dictionary Structures

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

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