Before you keep reading...

Runestone Academy can only continue if we get support from individuals like you. As a student you are well aware of the high cost of textbooks. Our mission is to provide great books to you for free, but we ask that you consider a $10 donation, more if you can or less if $10 is a burden.

Support Runestone Academy Today

3.12. Using a Queue in C++

Now we will turn our attention to using the queue data structure with the help of the Standard Template Library (STL) in C++.

As we described in Chapter 1, in C++, as in any object-oriented programming language, the implementation of choice for an abstract data type such as a queue is a class in which the queue operations are implemented as methods. Fortunately, the STL already has a well written implementation of the queue class.

In following queue implementation (ActiveCode 1) as push operations occur, new items are always added on the rear end of the queue and pop operations will manipulate the opposite side, the front end.

#include <iostream> #include <queue> // Using an STL queue using namespace std; int main() { queue<int> newQueue; newQueue.push(3); newQueue.push(8); newQueue.push(15); cout << "Queue Empty? " << newQueue.empty() << endl; cout << "Queue Size: " << newQueue.size() << endl; cout << "Top Element of the Queue: " << newQueue.front() << endl; newQueue.pop(); cout << "Top Element of the Queue: " << newQueue.front() << endl; return 0; }

class Queue: def __init__(self): self.items = [] def isEmpty(self): return self.items == [] def push(self, item): self.items.insert(0,item) def pop(self): return self.items.pop() def front(self): return self.items[len(self.items)-1]; def size(self): return len(self.items) def main(): q=Queue() q.push(3) q.push(8) q.push(15) print("Queue Empty? ", q.isEmpty()) print("Queue Size: ", q.size()) print("Front Element of the Queue: ", q.front()) q.pop(); print("Front Element of the Queue: ", q.front()) main()

Self Check

Q-3: Suppose you have the following series of queue operations.

queue<int> q;
q.push(10);
q.push(20);
q.push(30);
q.pop();

What items are left on the queue?

• 10, 20
• Remember the first item added to the queue is the first item removed. Remember FIFO.
• 20, 30
• Yes, first in first out means that the 10 is now gone.
• 10, 30
• Queues and stacks are both data structures where you can only access the first or the last items.
• 10, 20, 30
• Oops, maybe you missed the pop call at the end?

Before you keep reading...

Making great stuff takes time and $$. If you appreciate the book you are reading now and want to keep quality materials free for other students please consider a donation to Runestone Academy. We ask that you consider a $10 donation, but if you can give more thats great, if $10 is too much for your budget we would be happy with whatever you can afford as a show of support.

Support Runestone Academy Today

You have attempted 1 of 4 activities on this page