Implementation Considerations

• Could use an array.

• But, when removing an element from the array you'd have to move all the others up. Or, keep track of front and rear indices (complicated).

• Linked list can dynamically have a node per customer no matter how many are added or removed.

• We'll pick a singly linked list to implement the queue. Figure 12.9 shows a Queue object.

• BTW, Fig 12.8 shows addresses of nodes.