Question

Create a QUEUE ADT. QUEUE should be implemented using the linked

list.

b) Enter ten random integer numbers between 0 to 50 in the QUEUE.

c) After adding each element, print the content of the QUEUE.

c) Delete five numbers from the QUEUE.

d) Print the content of the QUEUE.

d) Finally, destroy the QUEUE.

(in c/c++)

Answer 1

#include <iostream>

#include <stdlib.h>

#include <time.h>

using namespace std;

class Node{

private:

int data;

Node* nextNodePtr;

Node* prevNodePtr;

public:

Node(){}

void setData(int d){

data = d;

}

int getData(){

return data;

}

void setNextNodePtr(Node* nodePtr){

nextNodePtr = nodePtr;

}

Node* getNextNodePtr(){

return nextNodePtr;

}

void setPrevNodePtr(Node* nodePtr){

prevNodePtr = nodePtr;

}

Node* getPrevNodePtr(){

return prevNodePtr;

}

};

class Queue{

private:

Node* headPtr;

Node* tailPtr;

public:

Queue(){

headPtr = new Node();

tailPtr = new Node();

headPtr->setNextNodePtr(0);

tailPtr->setPrevNodePtr(0);

}

Node* getHeadPtr(){

return headPtr;

}

Node* getTailPtr(){

return tailPtr;

}

bool isEmpty(){

if (headPtr->getNextNodePtr() == 0)

return true;

return false;

}

void enqueue(int data){

Node* newNodePtr = new Node();

newNodePtr->setData(data);

newNodePtr->setNextNodePtr(0);

Node* lastNodePtr = tailPtr->getPrevNodePtr();

if (lastNodePtr == 0){

headPtr->setNextNodePtr(newNodePtr);

newNodePtr->setPrevNodePtr(0);

}

else{

lastNodePtr->setNextNodePtr(newNodePtr);

newNodePtr->setPrevNodePtr(lastNodePtr);

}

tailPtr->setPrevNodePtr(newNodePtr);

}

int dequeue(){

Node* firstNodePtr = headPtr->getNextNodePtr();

Node* nextNodePtr = 0;

int poppedData = -100000; //empty queue

if (firstNodePtr != 0){

nextNodePtr = firstNodePtr->getNextNodePtr();

poppedData = firstNodePtr->getData();

}

else

return poppedData;

if (nextNodePtr != 0){

nextNodePtr->setPrevNodePtr(0);

headPtr->setNextNodePtr(nextNodePtr);

}

else{

headPtr->setNextNodePtr(0);

tailPtr->setPrevNodePtr(0);

}

return poppedData;

}

void printQueue(){

Node* temp = headPtr->getNextNodePtr();

while( temp != NULL){

cout <<temp->getData() <<" ";

temp = temp->getNextNodePtr();

}

cout<<endl;

}

int peek(){

Node* firstNodePtr = headPtr->getNextNodePtr();

if (firstNodePtr != 0)

return firstNodePtr->getData();

else

return -100000; //empty queue

}

void destroy(){

Node* temp = headPtr->getNextNodePtr();

while( temp != NULL){

Node* prev = temp;

temp = temp->getNextNodePtr();

delete prev;

}

}

};

int main()

{

Queue *q = new Queue();

srand(time(NULL));

for(int i = 1;i<=10; ++i){

q->enqueue(rand()%50);

q->printQueue();

}

int i = 1;

cout << "Deque 5 elements: "<<endl;

while(!q->isEmpty() && i<=5){

cout<<q->dequeue()<<" ";

i = i + 1;

}

cout << "\nQueue contents after deleting 5 elements is: "<<endl;

q->printQueue();

q->destroy();

cout<<"Queue destroyed. "<<endl;

}

==================================================

SEE OUTPUT

Thanks, PLEASE COMMENT if there is any concern. PLEASE UPVOTE, PLEASE COMMENT