Skip to main content

Implementation of Queue Data Structure using linked list in C++

 Hello, coders of Space of Coders!

Implementation of Queue Data Structure using linked list in C++ is below:

Note:- Scroll horizontally to see the full line of code.

#include<iostream>
using namespace std;

class node{
    public:
    int data;
    node* next;
    node(int x){
        data = x;
        next = NULL;
    }
};

class queue{
    public:
    node* front;
    node* rear;

    queue(){
        front = NULL;
        rear = NULL;
    }

    void enqueue(int x){

        node* n = new node(x);
        if(front==NULL){
            rear = n;
            front = n;
            return;
        }
        rear->next = n;
        rear = n;
    }

    void dequeue(){
        if(front==NULL){
            cout<<"Queue is Empty!";
            return;
        }
        node* todelete = front;
        front = front->next;
        delete todelete;
    }

    int frontElement(){
        if(front==NULL){
            cout<<"Queue is Empty!";
            return -1;
        }
        return front->data;
    }

    int rearElement(){
        if(front==NULL){
            cout<<"Queue is Empty!";
            return -1;
        }
        return rear->data;
    }

    int size(){
        if(front==NULL){
            cout<<"Queue is Empty!";
            return 0;
        }
        int sum = 0;
        node* temp = front;
        while(temp!=NULL){
            sum+=1;
            temp = temp->next;
        }
        return sum;
    }

    void displayQueue(){
        if(front==NULL){
            cout<<"Queue is Empty!";
            return;
        }
        node* temp = front;
        while(temp!=NULL){
            cout<<temp->data<<" ";
            temp = temp->next;
        }
        cout<<endl;
    }
};

int main(){
    queue q;
    q.enqueue(5);
    q.enqueue(10);
    q.displayQueue();
    q.dequeue();
    q.displayQueue();
    q.enqueue(15);
    q.displayQueue();
    q.enqueue(25);
    q.displayQueue();
    q.enqueue(10);
    q.displayQueue();
    q.dequeue();
    q.dequeue();
    q.dequeue();
    q.dequeue();
    q.enqueue(45);
    q.displayQueue();
    cout<<"The size of Queue is: "<<q.size()<<endl;;
    cout<<"The front element of Queue is: "<<q.frontElement()<<endl;
    cout<<"The rear element of Queue is: "<<q.rearElement()<<endl;
    return 0;
}


Thank you!!!
Labels:

Comments

Post a Comment

Popular posts from this blog

Uninstalling AnyDesk from Ubuntu: A Step-by-Step Guide

If you're an Ubuntu user looking to remove AnyDesk from your system and reclaim valuable space, this straightforward guide will walk you through the uninstallation process with easy-to-follow steps. Step 1: Launch the Terminal To initiate the uninstallation process, open the Terminal on your Ubuntu system by simultaneously pressing "Ctrl + Alt + T." Step 2: Verify AnyDesk Installation Confirm that AnyDesk is installed on your system by typing the following command in the Terminal and pressing "Enter": dpkg -l | grep anydesk The relevant information will be displayed if AnyDesk is installed. Step 3: Uninstall AnyDesk Remove AnyDesk from your Ubuntu system using the following command in the Terminal: sudo apt-get remove anydesk Enter your user password when prompted (characters won't be visible as you type) and press "Enter" to authorize the uninstallation. Step 4: Confirm Unins...
Post a Comment
Read more

SET THEORY USING LIST IN PYTHON

Problem Statement :- In second-year computer engineering class, group A student's play cricket, group B students play badminton and group C students play football.  Write a Python program using functions to compute the following:-     a) List of students who play both cricket and badminton     b) List of students who play either cricket or badminton or both     c) Number of students who play neither cricket nor badminton     d) Number of students who play cricket and football but not badminton. (Note- While realizing the group, duplicate entries should be avoided, Do not use SET built-in functions) Note :- Scroll horizontally to see the full line of code. def   Addelem ( A ,  a ):      for   i   in   range  ( a ):          elem = input ( "Enter the name of student:" )          if ( elem   ...
Post a Comment
Read more

Implementations of Search Algorithms using Python | Linear Sequential Search | Sentinel Sequential Search | Binary Search | Fibonacci Search

  Problem Statement:-  a) Write a Python program to store roll numbers of student in array who attended training program in random order. Write function for searching whether particular student attended training program or not, using Linear search and Sentinel search. b) Write a Python program to store roll numbers of students array who attended training program in sorted order. Write function for searching whether particular student attended training program or not, using Binary search and Fibonacci search. Note:-  Scroll horizontally to see the full line of code. def linear_search ( a , target ):     for i in range ( len ( a )):         if ( a [ i ]== target ):             print ( "Roll no." , target , "is present at index" , i )             break     else :         print ( "Roll no." , target , "not found in list" ) def binary_search ( a , targ...
Post a Comment
Read more

C++ Program for storing Appointments Schedule for day using Linked list | Display Free Slots | Book Appointment | Cancel Appointment | Sort Appointments

  Problem Statement: Write C++ program for storing appointment schedule for day. Appointments are booked randomly using linked list. Set start and end time and min and max duration for visit slot. Write Functions for-     A) Display free slots     B) Book appointments     C) Sort list based on time     D) Cancel appointment ( check validity, time bounds, availability )     E) Sort list base on time using pointer manipulation. Note: Scroll Horizontally to see the full line of code. #include < iostream > using namespace std ; class slot { public :     int startTime , endTime , min , max ;     bool status ;     slot * next ;     slot ( int start , int end , int min , int max )     {         startTime = start ;         endTime = end ;         this -> min = min ;         this ->...
Post a Comment
Read more

Complete Guide: Uninstalling Steam from Ubuntu - Step-by-Step

Steam is widely favored among gamers for its seamless game distribution and vibrant community engagement. However, excessive game installations can burden your PC, leading to sluggish performance and potential system crashes. If you're facing such issues, a thorough uninstallation of Steam from your Ubuntu system might be the solution. Simply removing Steam using standard methods may leave residual files and directories on your device, potentially causing lingering issues. This comprehensive guide will walk you through the process of completely removing Steam from your Ubuntu system. Steps to Fully Uninstall Steam from Ubuntu: Before proceeding, ensure to back up any important data as uninstalling Steam will also remove all associated games, DLCs, and saved data. Follow these steps to uninstall Steam from Ubuntu: Step 1: Open the terminal by right-clicking or pressing “ctrl...
Post a Comment
Read more