Data Structures Using C++: Queue Introduction Quiz

Queue is referred to as a LIFO structure (Last-In First-Out)

In a queue, new data items are added at the front, or head, of the queue

The main primitive operations of a queue are Insert(), Add(), and Remove()

A queue is an ordered collection of items in which new data items are added at the end, or tail, of the queue while other data are removed from the front, or head, of the queue

Is_Full() reports whether the queue is empty