6.5 Queue Using Arrays

Program Definition
Insert a set of integers into the QUEUE and delete these integers by QUEUE using linked lists
Algorithm:
CODE
#include
#include
#include
#include
class queue
{
private:
int element;
struct node
{
int value;
node *next;
};
node *front,*rear;
public:
queue()
{
front=NULL;
rear=NULL;
}
void insert();
void delelement();
void display();
};
void queue::insert()
{
node *temp;
temp=new node;
cout<<"\nenter the element into the queue:";
cin>>element;
temp->value=element;
if(front==NULL)
{
front=temp;
rear=temp;
rear->next=NULL;
}
else
{
while(rear->next!=NULL)
rear=rear->next;
rear->next=temp;
rear=temp;
rear->next=NULL;
}
}
void queue:: delelement()
{
node *temp;
if(front==NULL)
cout<<"queue is empty\n";
else
{
temp=front;
front=front->next;
cout<<"\nelement deleted from queue is:";
cout<value;
delete temp;
}
}
void queue::display()
{
node *temp;
if(front==NULL)
cout<<"queue is empty";
else
{
cout<<"elements present in the queue are\n";
for(temp=front;temp!=NULL;temp=temp->next)
{
cout<value<<"\n";
}
}
}
void main()
{
queue q;
int chioce;
clrscr();
while(1)
{
cout<<"\n1.insert 2.delete 3.display 4.exit \n";
cout<<"enter your chioce:";
cin>>chioce;
switch(chioce)
{
case 1:
q.insert();
break;
case 2:
q.delelement();
break;
case 3:
q.display();
break;
case 4:
exit(0);
}
}
}