Queues, Deques and Priority Queues
Linear and circular array queues with the full, empty and count tests for each common convention, a traced circular queue, deques and input- or output-restricted deques with their reachable output orders, priority queue implementations compared, a queue built from two stacks and a stack built from two queues with exact operation counts (each queue item costs four stack operations), and linked queues.
