Class Queue<T>

A First-In-First-Out (FIFO) data structure. The first element added to the queue will be the first one to be removed.

This base class only allows the following operations:

• peek(): inspect the first item without removing it
• push(): append an item to the queue
• pop(): remove the first item from the queue

Typeparam

T : the type of items in this Queue