How to Implement Queue in C++ using Array Data structures

How to Implement Queue in C++ using Array Data structures?

How to start Queue C++

Enqueue Implementations C++ Explained

Dequeue Implementations C++ Explained

Queue Overflow example in C++

Program  to Implement Queue in C++ using Array

//Implementation of Queue in C++ by T4Tutotirlas.com
#include <iostream>
using namespace std;
int queue[50];
int n = 50;
int front = - 1;
int  rear = - 1;
//Implementation of EnQueue in C++ by T4Tutotirlas.com
void Queue_insertion() {
   int val;
   if (rear == n - 1)
      cout<<"Queue Overflow"<<endl;
   else {
    
      front = 0;
      cout<<" insert value in the queue : "<<endl;
      cin>>val;
      rear++;
      queue[rear] = val;
   }
}
//Implementation of DeQueue in C++ by T4Tutotirlas.com
void Delete() {
   if (front == - 1) {
      cout<<"Queue Underflow ";
   return ;
   } else {
      cout<<"Element deleted from queue is : "<< queue[front] <<endl;
      front++;;
   }
}
//Implementation of display Queue in C++ by T4Tutotirlas.com
void Display_Queue () {
   if (front == - 1 )
   cout<<"Queue is empty"<<endl;
   else {
      cout<<"Queue elements are : ";
      for (int i = front; i <= rear; i++)
         cout<<queue[i]<<" ";
      cout<<endl;
   }
}
int main() {
   int ch;
   cout<<"1) insertion element to the queue"<<endl;
   cout<<"2) Delete element from queue"<<endl;
   cout<<"3) Display all the elements of queue"<<endl;
   cout<<"4) Exit"<<endl;
do {
   cout<<"Enter your choice : "<<endl;
   cin>>ch;
    switch (ch) {
      case 1: Queue_insertion();
         break;
      case 2: Delete();
         break;
      case 3: Display_Queue ();
         break;
      case 4: cout<<"Exit"<<endl;
         break;
      default: cout<<"Invalid choice"<<endl;
   }
} while(ch!=4);
   return 0;
}

Output for Deque

Output for displaying the queue

Output for insert , delete, and display element to queue

Download Code

Click here C++ Prgram to Implement Queue using Array Data structures to download the source code.