Insertion in a Queue in C++

November 2, 2023

Insertion in a Queue in C++

 

Queue is  a data structure where you can insert elements in First in First out manner, so you can store values in order to they are coming in a structure. This basic data structure has two major properties, enqueue and dequeue. In this particular article, we will find how to insert elements in a queue in C++, i.e. Enqueueing elements. Here we will use OOps Concept and List prebuilt structure.

Insertion in a Queue in C++

What is Queue?

 
Queue is a standard linear user defined data structure that allows you to pre-store  elements in the specific order it gets, as get a first in first out or FIFO feature in that.

 

The Agorithm to insert in Queue : Enqueue

Here goes the following algorithm that tells us how to enqueue / Insert elements in a queue.

  • Let’s say the queue is a linked list. Here we have used a predefined linkedlist that is available inside C++ standard template library (List in STL), and made a class where there is a member variable of that type.
  • Now Queue is first in first out. So the pushes will be at back of the list. You can obtain that in a different way, in C too : Here it is.
  • That means, if queue is empty, we will simply push that element into it.
  • Otherwise we will make a place at the back and add the element there.
DSA desktop gif
DSA mobile gif

Types of Queues in Data Structure

Application of Queue Data Structure

Deletion (Removal) in Queues Program(Dequeuing)

Reverse a Queue

Queues using Linked Lists

Insertion in a Queue in C

The code to implement this:

Run 
#include<bits/stdc++.h>
using namespace std;

class Queue
{
  public:
  list<int> L;
  void Push(int i)
  {
    cout<<"Pushing the element : "<<(i)<<endl;
    L.push_back(i);
  }
  int pop()
  {
    if(L.empty()) 
    {
       cout<<"The queue is empty"<<endl;
    }
    int a=L.front();
    L.pop_front();
    return a;
  }
  void Show()
  {
    for(auto i:L)
    cout<<i<<" " ;
    cout<<endl;
  }
};

int main()
{
  Queue q;
  q.Push(2);
  q.Push(9);
  q.Push(3);
  q.Push(5);
  q.Push(12);
  q.Push(1);
  q.Show();
}

Output:

Pushing the element : 2
Pushing the element : 9
Pushing the element : 3
Pushing the element : 5
Pushing the element : 12
Pushing the element : 1
2 9 3 5 12 1

Prime Course Trailer

Related Banners

Get PrepInsta Prime & get Access to all 200+ courses offered by PrepInsta in One Subscription

Get Prime

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others

Get Prime
Course List
Course List

Checkout list of all the video courses in PrepInsta Prime Subscription

Checkout list of all the video courses in PrepInsta Prime Subscription

Checkout
Checkout

Stacks

  • Introduction to Stack in Data Structure
    Click Here
  • Operations on a Stack
    Click Here
  • Stack: Infix, Prefix and Postfix conversions
    Click Here
  • Stack Representation in –
    C | C++ | Java
  • Representation of a Stack as an Array. –
    C | C++ | Java
  • Representation of a Stack as a Linked List. –
    C | C++ | Java
  • Infix to Postfix Conversion –
    C | C++ | Java
  • Infix to prefix conversion in –
    C | C++ | Java
  • Postfix to Prefix Conversion in –
    C | C++ | Java

Queues

  • Queues in Data Structures (Introduction)
    Click Here
  • Queues Program in C and implementation
    Click Here
  • Implementation of Queues using Arrays | C Program
    Click Here
  • Types of Queues in Data Structure
    Click Here
  • Application of Queue Data Structure
    Click Here
  • Insertion in Queues Program (Enqueuing) –
    C | C++ | Java
  • Deletion (Removal) in Queues Program(Dequeuing) –
    C | C++ | Java
  • Reverse a Queue –
    C | C++ | Java
  • Queues using Linked Lists –
    C | C++ | Java
  • Implement Queue using Stack –
    C | C++ | Java
  • Implement Queue using two Stacks –
    C | C++ | Java

Circular Queues

Priority Queue

  • Application of Priority Queue
  • Priority Queue Example
  • Priority Queue Introduction –
    C | C++ | Java
  • Priority Queue Implementation using Array –
    C | C++ | Java
  • Priority Queue using Linked List –
    C | C++ | Java
  • Priority Queue Insertion and Deletion-
    C | C++ | Java

Stacks

Queues

Circular Queues

Priority Queue

  • Application of Priority Queue
  • Priority Queue Example
  • Priority Queue Introduction – C | C++ | Java
  • Priority Queue Implementation using Array – C | C++ | Java
  • Priority Queue using Linked List – C | C++ | Java
  • Priority Queue Insertion and Deletion- C | C++ | Java