黄永平《计算机导论精品教学》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 co