All lessonsOpen Open Open Open Open
4. Stacks & Queues
Queues
0 of 5 activities0%
Reading 1
First in, first out
Queue: enqueue at the back, dequeue from the front.
Use std::queue or a deque. Arrays with head/tail indexes can implement a circular queue to reuse space.
BFS relies on queues.
queue<int> q;
q.push(1);
q.push(2);
cout << q.front();
q.pop();Check 2
Order
After enqueue 1, enqueue 2, dequeue — removed value is
Fill in 3
Acronym
Try it 4
Simple queue
Use deque as queue.
main.cpp
Loading editor…
Output will appear here.
Assignment 5
Process queue
Read n, then n ints into a queue order. Print them front to back separated by spaces.
main.cpp
Loading editor…