Question

Write C++ programs to implement Queue ADT data structure using Linked List.

Answer 1

#include<iostream>

#include<stdio.h>

#include<conio.h>

using namespace std;

struct node

{

    int data;

    node *next;

}*front = NULL,*rear = NULL,*p = NULL,*np = NULL;

void push(int x)

{

    np = new node;

    np->data = x;

    np->next = NULL;

    if(front == NULL)

    {

        front = rear = np;

        rear->next = NULL;

    }

    else

    {

        rear->next = np;

        rear = np;

        rear->next = NULL;

    }

}

int remove()

{

    int x;

    if(front == NULL)

    {

        cout<<"Empty Queue\n";

    }

    else

    {

        p = front;

        x = p->data;

        front = front->next;

        delete(p);

        return(x);

    }

}

int main()

{

    int n,c = 0,x;

    cout<<"Enter the number of values to be pushed in queue\n";

    cin>>n;

    while (c < n)

    {

   cout<<"Enter the value to be entered in queue\n";

   cin>>x;

        push(x);

        c++;

     }

     cout<<"\n\nELIMINATED VALUES\n\n";

     while(true)

     {

        if (front != NULL)

            cout<<remove()<<endl;

        else

            break;

     }

     getch();

}