Data Structures · topic
Linear and circular queues with the full and empty tests for each convention, deques and restricted deques, priority queue implementations, a queue built from two stacks and a stack built from two queues with exact operation counts, and linked queues.
A queue is a collection in which elements are inserted at one end, the rear, and removed from the other end, the front. The element removed is the one that has waited longest: first in, first out (FIFO). A ticket counter line is the usual picture.
One-page visual sheets for this topic, in the sheet library on the store. Previews are free; the full sheets come with the subject pack.
