The purpose of this chapter is to discuss the use of a variety of common Abstract Data Types using Modula-2. On completing the chapter, the student should understand and be able to use the following:
General:
data aggregates in a variety of forms
Realized in the Modula-2 notation:
one or more implementations of each of lists, queues, stacks, tables, and trees in a semi-generic fashion
General:
a number of techniques for working with pointers and ADTs
Realized in the Modula-2 notation:
insertion and deletion in lists, queues, stacks, tables, and trees
General:
traversing a structure with a procedure to act on data in the nodes
Realized in the Modula-2 notation:
linear traversals in lists, queues and stacks, and in, pre, and post order traversals of trees