|
|
|
|
|
|
|
Figure 18-3
Array Representation of a
Linked List |
|
|
|
|
|
|
|
|
must implement it using some existing data representation. One data representation is the built-in array, a sequential structure. Another data representation is the linked list, a linked structure. But a linked list is, itself, an ADT and requires a concrete data representation-an array of structs, for example. To help visualize all these relationships, we use an implementation hierarchy diagram, such as the one shown in Figure 18-5. In this diagram, each data type is implemented by using the data type(s) directly below it in the hierarchy. |
|
|
|
|
|
|
|
|
Figure 18-4
Array Representation of Linked List After 25 Was Inserted |
|
|
|
|
|
