A queue is a first-in, first-out (FIFO) collection. Basic operations are Enqueue and Dequeue, respectively, to add an element to the end of the queue and to retrieve the first element in the queue. Compare this to a queue in the supermarket: If you’re in front, you are served first. Figure 16.3 illustrates the principle of a queue’s operation.


FIGURE 16.3 Dequeue, Peek, and Enqueue operations on a queue data structure.

The following is a real-world example of a queue:

var postOffice = new Queue();postOffice.Enqueue(new Person("Bart", 10));postOffice.Enqueue(new Person("Homer", 38));postOffice.Enqueue(new Person("Ned", ...

Get C# 5.0 Unleashed now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.