Previous Section
 < Free Open Study > 
Next Section


Chapter 9: Priority Queues, Heaps, Graphs, and Sets

Goals

After studying this chapter, you should be able to

We have examined several basic data types in depth, discussing their uses and operations, and investigating one or more implementations of each. As we have constructed these programmer-defined data structures out of the built-in types provided by our high-level language, we have noted variations that adapt them to the needs of different applications. In Chapter 8, we saw how a tree structure, the binary search tree, facilitates searching data stored in a linked structure. In this chapter, we consider how other branching structures are used to model a variety of applications.

We end the chapter by looking at the Set ADT, an abstract data type that models the mathematical entity called a set.



Previous Section
 < Free Open Study > 
Next Section
Converted from CHM to HTML with chm2web Pro 2.85 (unicode)