Question: 1.Display all even intergers from 2 to 200 in a QUEUE using linked list. Create .h file and a .cp……

queuee.h

#include<iostream>

using namespace std;
struct Node{
int no; //data part
Node *next; //link part
}; //structure of the node of the linked queue

class Queue
{
public:
Node *front,*rear; //declare the front and rear as node type
Queue(){front=rear=NULL;} //initialize the front and rear to NULL value

void insert(int n); //insert method prototype
void delet(); //prototypeof delete method
void display(); //prototype of display item
~Queue(); //destructor
};

void Queue::insert(int n) //defination of insert method
{
Node *temp=new Node; //allocate the memory for new node
if(temp==NULL){ //condition for overflow
cout<<“Overflow”<<endl;
return;
}
temp->no=n; //assigning the number to link list node
temp->next=NULL; //assigning NULL to last

//for first node
if(front==NULL){
front=rear=temp;
}
else{ //other than first node
rear->next=temp;
rear=temp;
}
}

void Queue::display(){
if(front==NULL){ //If no elements are in the linked queue
cout<<“Underflow.”<<endl;
return;
}
Node *temp=front;
//will check until NULL is not found
while(temp){
cout<<temp->no<<” “;
temp=temp->next;
}
cout<<endl;
}

void Queue :: delet() //defination of delet method
{
if (front==NULL){ //condition of underflow
cout<<“underflow”<<endl;
return;
}

cout<<front->no<<” is being deleted “<<endl; //display the number WHICH IS deleted
if(front==rear)//if only one node is there
front=rear=NULL;
else
front=front->next;
}

Queue ::~Queue()
{
while(front!=NULL) //deleteing the entire list
{
Node *temp=front;
front=front->next;
delete temp;
}
rear=NULL;
}

queue.cpp

#include<iostream>

#include”queuee.h” //including the header file

using namespace std;

int main()

{

int i;

Queue Q; //declaring the queue object

for(i=2;i<=100;i+=2) //generating the even number from 2 to 200 (inclusive)

Q.insert(i); //call to insert method to insert the even numbers

cout<<endl<<“The lements of linked queue are “;

Q.display(); //call to display method to display the elements

return 0;

}

NOTE : HERE I HAVE ALSO DEFINE THE DELETE METHOD BUT ITS NOT USED BECAUSEIN QUESTION IT WAS NOT MENTIONED TO DELETE THE ELEMENTS. BUT AS A COMPLETE IMPLEMENTATION OF QUEUE I HAVE PROVIDED .

OUTPUT