“Queue is pronounced “Q” followed by four letters that are silently waiting their turn.”

First in, first out (FIFO)

Queues can be made with arrays or linked lists

Queues can be visualized as a horizontal/width structure and is best with BFS.

std::deque is a double-ended queue

Runtime Complexity

lookup append insert delete

enqueue dequeue traverse, display isEmpty

Space Complexity

Priority Queue

Exercises

  • Implement a queue with queue and dequeue functions.