C++ Tutorial Index

C++ Tutorial C++ History C++ Installation C++ First Program C++ cin and cout C++ Data type C++ Variable C++ operator C++ Keywords

C++ Control Statements

C++ If C++ Nested if C++ If-else C++ If-else-if C++ Switch C++ Break C++ Continue C++ Goto C++ For loop C++ While loop C++ Do while loop

C++ Functions

C++ Call by Value C++ Call by Reference C++ Recursion Function C++ Inline function C++ Friend function

C++ Arrays

Single dimension array Two dimension array

C++ Strings

C++ Strings

C++ Inheritance

C++ Inheritance Single level Inheritance Multilevel Inheritance Multiple Inheritance Hierarchical Inheritance Hybrid Inheritance

C++ Polymorphism

C++ Polymorphism C++ Overloading C++ Overriding C++ Virtual Function

C++ Pointers

C++ Pointers C++ this pointer

C++ Exception Handling

C++ Exception Handling

C++ Constructors

C++ Constructors Default Constructor Parameterize Constructor Copy constructor Constructor Overloading Destructor

C++ File Handling

C++ File Handling C++ Writing to file C++ Reading file C++ Close file


C Vs C++ C++ Comments C++ Data Abstraction C++ Identifier C++ Memory Management C++ Storage Classes C++ Void Pointer C++ Array To Function C++ Expressions C++ Features C++ Interfaces C++ Encapsulation std::min in C++ External merge sort in C++ Remove duplicates from sorted array in C++ Precision of floating point numbers Using these functions floor(), ceil(), trunc(), round() and setprecision() in C++ C++ References C++ Friend Functions C++ Mutable keyword Unary Operators in C++ Initialize Array of objects with parameterized constructors in C++ Differences between #define & const in C/C++ C++ Program to Implement Shell Sort C++ Program to Implement Merge Sort Storage Classes in C Vector resize() in C++ Passing by Reference Vs. Passing by the pointer in C++ Free vs delete() in C++ goto statement in C and C++ C++ program to read string using cin.getline() C++ String Concatenation Heap Sort in C++ Swap numbers in C++ Input Iterators in C++ Fibonacci Series in C++ C ++ Program: Alphabet Triangle and Number Triangle C++ Program: Matrix Multiplication C++ Program to Print Fibonacci Triangle Stack in C++ Maps in C++ Queue in C++ C++ Bitset C++ Algorithms Priority Queue in C++ C++ Multimap C++ Deque Function Pointer in C++ Sizeof() Operators in C++ C++ array of Pointers free() Vs delete in C Timsort Implementation Using C++ CPP Templates C++ Aggregation C++ Enumeration C++ Math Functions C++ Object Class C++ Queue Initialize Vector in C++ Vector in C++ C++ STL Components Function overloading in C++ C++ Maximum Index Problem C++ find missing in the second array C++ Program to find the product array puzzle C++ Program To Find Largest Subarray With 0 Sum C++ Program To Move All Zeros To The End Of The Array C++ Program to find the element that occurs once C++ Program to find the largest number formed from an array Constructor Vs Destructor C++ Namespaces C++ OOPs Concept C++ Static C++ Structs C++ Try-Catch C++ User Defined Exceptions C++ Virtual Destructor C++ vs C# Malloc() and new in C++ Palindrome Number Program in C++ Snake Code in C++ Splitting a string in C++ Structure Vs Class in C++ Virtual Function Vs Pure Virtual Function C++ Bidirectional Iterators C++ Forward Iterators C++ Iterators C++ Output Iterators C++ Range-based For Loop Converting string into integer in C++ LCM Program in C++ Type conversion in C++ Add two numbers using the function in C++ Advantage and disadvantage friend function C++ Armstrong Number Program in C++ ATM machine program in C++ using functions Binary to Decimal in C++ Bit Manipulation in C++ C++ Constructor C++ Dijkstra Algorithm Using the Priority Queue C++ int into String C++ Signal Handling Decimal to Binary in C++ Decimal to Hexadecimal in C++ Decimal to Octal in C++ Factorial Program in C++ Function in C++ Hexadecimal to Decimal in C++ Octal to Decimal in C++ Reverse a Number in C++ Structure Vs Class in C++ C++ Forward Iterators C++ Output Iterators C++ Prime number program Char Array to String in C++ Constructor Overloading in C++ Default arguments in C++ Different Ways to Compare Strings in C++ Dynamic Binding in C++ Program to convert infix to postfix expression in C++ SET Data Structure in C++ Upcasting and Downcasting in C++ Reverse an Array in C++ Fast Input and Output in C++ Delete Operator in C++ Copy elision in C++ C++ Date and Time C++ Bitwise XOR Operator Array of sets in C++ Binary Operator Overloading in C++ Binary Search in C++ Implementing the sets without C++ STL containers Scope Resolution Operator in C++ Smart pointers in C++ Types of polymorphism in C++

Queue in C++

What is Queue?

As the name suggests, the queue is the type of data structure that follows the FIFO (First In - First Out) mechanism. In simple words, it is a linear data structure that resembles somewhere like a stack but has the difference of entry and exit in the elements i.e unlike stacks. It is open at both ends. One end is used to insert data (enqueue) and the other end is used to remove data (dequeue).

Queues are just like lines at a ticket counter or a cash-counter where the first entering person is the first exiting person as well.

There is a similar operation of the queue just like the stacks. Some of the operations include:

peek() ? Gets the first element of queue without

removing it.

isfull() ? Checks if it is full.

isempty() ? Checks if it is empty.

These 3 above operations are efficient enough to serve the major two operations of queues and they are:

Enqueue():  Adds or stores item in the queue.

Dequeue():  Removes or prevents access of items in the queue.

Let us now look at some pseudo-codes for understanding operations in queue.

  1. Peek()
 int peek_or_top() {
    return queue[front_element];
  • isFull()
 bool isfull()
    if(rear == MaximumSize - 1)
       return true;
       return false;
  • isEmpty()
 bool isempty() {
    if(front < 0 || front > rear)
       return true;
       return false;

The above operational codes are just the minor steps to approach a problem involving implementations of queues. Let us look at a program to understand the flow control of queues better.

 #define SIZE 5
 using namespace std;
 int q[SIZE],front=0,rear=0;
 int main()
 int ch;
 void enqueue();
 void dequeue();
 void display();
 cout<<"\n 1. add element";
 cout<<"\n 2. remove element";
 cout<<"\n 3.display";
 cout<<"\n 4.exit";
 cout<<"\n enter your choice:";
 case 1:
 case 2:
 case 3:
 case 4:
 cout<<"\n invalid choice";
 void enqueue()
 int no;
 if (rear==SIZE && front==0)
 cout<<"queue is full";
 cout<<"enter the num:";
 void dequeue()
 int no,i;
 if (front==rear)
 cout<<"queue is empty";
 cout<<"\n"<<no<<" removed from the queue\n";
 void display()
 int i,temp=front;
 if (front==rear)
 cout<<"the queue is empty";
 cout<<"\n element in the queue:";
 cout<<q[i]<<" ";


Queue in C++
Queue in C++


The above code depicts the flow for adding and removing elements in a queue. To understand how the enqueue and dequeue operations are performed, look at the following algorithm below.


1.Initialize a variable of any choice

  1. Read the variable
  2. If(top == 1) then
  3. call insert function 
  4. Else
  5. call delete function
  6. End

Algorithm for inserting in Array-Queue:

  1. If rear = NULL
  2. rear=front=0
  3. QUEUE[0]=ITEM }
  4. Else If rear= N-1 then
  5. Print "Queue Overflow!"
  6. Else
  7. QUEUE[rear+1]=ITEM
  8. rear=rear+1
  9. END.

Algorithm for deleting in Array-Queue:

1.If front==NULL then

2. Print "Queue is Empty" 

3. Else

4. ITEM=QUEUE[front]

5. If front=rear Then

6. front=rear=NULL

7. Else

8. front = front + 1

9. END

Note: The above algorithm works for mainly two operations namely enqueue and dequeue. Since these two operations are also associated with other sub-operations like peek(), isFull(), and isEmpty() we can also easily them from the above code.

Analysis of features and implementations

  1. Queues are widely used in sharing single resource serving requests like print, or task scheduling, etc.
  • Practically, queues are used in the same way the call-centers hold the calls until the representatives are free.
  • Queues can be used to handle real-time interrupts in the same order they arrive like first in first out.

Complexity Analysis

  1. Enqueue : O(1)
  2. Dequeue : O(1)
  3. Size : O(1)

Note: Queues are used where processing is not required. Processing may not need any priority since the priority queue follows a different approach. Queues follow the same approach as Breadth-First-Search (BFS).

Points to Remember:

  1. The point of entry and exit are different in a queue.
  2. Tw0 stacks can be used to make a queue.
  3. Random access is not allowed in the queue.
  4. We cannot simply add or remove elements from the middle of any queue.
  5. Inserting operation using an array is costly in the dequeue. This is because all the elements at a specific position need to be shifted by one. It is the same concept of similar people sitting on a bench and one person from one end pushes down the other to accommodate himself.