Data Structure Learning Hub

-1

front

rear

Front of the Queue :

Rear of the Queue :

Last Queued Item :

Last Dequeued Item :

Size of the Queue :

This is a message box

void enqeue(int x){
if(front==-1){
front=0;
}
if(rear==size-1){
printf("QUEUE OVERFLOW");
}
else{
rear++;
queue[rear]=x;
}
}

int dequeue(){
int x;
if(front==-1 || rear==-1 || front>rear){
printf("QUEUE UNDERFLOW");
}
else{
x=queue[front];
front++;
}
return x;
}