黄永平《计算机导论精品教学》ch12[Part4.Data Organization] Abstract Data Types2.pptVIP

Example 2 Show the result of the following operations on a queue Q.enqueue (Q , 23)if not empty (Q), dequeue (Q)enqueue (Q , 20)enqueue (Q , 19)if not empty (Q), dequeue (Q) Solution See Figure 12.15 (next slide). Figure 12-15 Example 2 enqueue (Q , 23)if not empty (Q), dequeue (Q)enqueue (Q , 20)enqueue (Q , 19)if not empty (Q), dequeue (Q) TREES 12.5 Figure 12-16 Representation of a tree Figure 12-17 Tree terminology Figure 12-18 Subtrees BINARY TREES 12.6 Figure 12-19 Binary tree Figure 12-20 Examples of binary trees Brooks/Cole, 2003 Chapter 12 AbstractData Type Understand the concept of an abstract data type (ADT). Understand the concept of a linear list as well as its operations and applications. After reading this chapter, the reader should be able to: OBJECTIVES Understand the concept of a stack as well as its operations and applications. Understand the concept of a queue as well as its operations and applications. Understand the concept of a tree as well as its operations and applications. Understand the concept of a graph as well as its operations and applications. BACKGROUND 12.1 Dont Reinvent the Wheel! Every software developer wants to create new and exciting stuff, but very often the same things are reinvented over and over again. The concept of abstraction means:1. You know what a data type can do.2. How it is done is hidden. Note: Examples: read keyboar,read file, C functions bank queue, Separating What and How Abstract Data Type Declaration of data Declaration of operations Encapsulation of data and operations and hide them from the user Note: ADT Definition Figure 12-1 Model for ADT Figure 12-1 Operations on ADTs Operational Interface Operational Interface LINEAR LISTS 12.2 Figure 12-2 Linear list A linear list is a list in which each element has a unique successor. Figure 12-3 Categories of linear lists Operations on linear lists Insertion Deletion Retrieval Traversal For general ordered linear lists Figure 12-4 Ins