ABSTRACT
Table 4.1 provides a visual summary for the organization of our coverage of ADTs and their corresponding data structures. Note that graphs are covered in Part III. The algorithms we present are integrated within the appropriate chapter. For maximum use, we place algorithms as high as possible in the class hierarchy while still ensuring that we provide an efficient implementation for them.
