#include <iostream>
#include "queue.h"
usingnamespacestd;intmain(){// Create an empty queue of data type int.
Queue<int>queue;// Enqueue 1.
if(queue.enqueue(1))cout<<1<<" successfully queued.\n";elsecout<<"failed to queue "<<1<<endl;// Enqueue 2.
if(queue.enqueue(2))cout<<2<<" successfully queued.\n";elsecout<<"failed to queue "<<2<<endl;// Enqueue 3.
if(queue.enqueue(3))cout<<3<<" successfully queued.\n";elsecout<<"failed to queue "<<3<<endl;// Get front element of queue.
intretrievedNumber;if(queue.get_front(retrievedNumber))cout<<"Front element: "<<retrievedNumber<<endl;elsecout<<"No front element.\n";// Get back element of queue.
if(queue.get_back(retrievedNumber))cout<<"Back element: "<<retrievedNumber<<endl;elsecout<<"No back element.\n";// Dequeue an element.
if(queue.dequeue())cout<<"Element dequeued.\n";elsecout<<"Unable to dequeue.\n";// Get front element of queue.
if(queue.get_front(retrievedNumber))cout<<"Front element: "<<retrievedNumber<<endl;elsecout<<"No front element.\n";// Get back element of queue.
if(queue.get_back(retrievedNumber))cout<<"Back element: "<<retrievedNumber<<endl;elsecout<<"No back element.\n";// Check if queue is empty.
if(queue.is_empty())cout<<"Queue is empty.\n";elsecout<<"Queue is not empty.\n";// Dequeue an element.
if(queue.dequeue())cout<<"Element dequeued.\n";elsecout<<"Unable to dequeue.\n";// Dequeue an element.
if(queue.dequeue())cout<<"Element dequeued.\n";elsecout<<"Unable to dequeue.\n";// Check if queue is empty.
if(queue.is_empty())cout<<"Queue is empty.\n";elsecout<<"Queue is not empty.\n";}
Sample Output
2 successfully queued.
1 successfully queued.
3 successfully queued.
Front element: 1
Back element: 3
Element dequeued.
Front element: 2
Back element: 3
Queue is not empty
Element dequeued.
Element dequeued.
Queue is empty.