#include <stdio.

h>
#include <stdlib.h>
#define CAP 5

int front = 0, rear = 0;

int Queue[CAP];

int isFull()
{
if (rear == CAP ){
return 1;
}
else
{
return 0;
}
}

int isEmpty()
{
if (front == rear){
return 1;
}
else
{
return 0;
}

void enqueue(int ele)

{
if(isFull()){
printf("Queue is full");
}
else
{
Queue[rear] = ele;
rear ++;
}

int dequeue(){
if ( isEmpty()){
printf("Queue is empty");
}
else
{
int ele = Queue[front];
for (int i = front; i < rear -1; i++)
{
Queue[i] = Queue[i+1];
}
rear --;
return ele;
}
return 0;
}

void traverse(){
printf("Elements of the queue are : \n");
for(int i = front; i < rear; i++)
printf("%d\t",Queue[i]);
}

int peek(){
if (isEmpty()){
printf("Queue is empty ");
return 0;
}
else
{
return Queue[front];
}

int length(){
if (isEmpty()){
return 0;
}
else{
return rear;
}
}

int main()
{
int choice, ele;

while (1)
{
printf("\nEnter \n 1.enqueue \n 2.dequeue \n 3.traverse \n 4.peek \n
5.length \n 6.exit \n");
printf("Enter your choice : ");
scanf("%d", &choice);
switch (choice)
{
case 1:
printf("Enter element to insert : ");
scanf("%d", &ele);

enqueue(ele);
break;

case 2:
printf("%d deleted ",dequeue());
break;

case 3:
traverse();
break;

case 4:
printf("Top element of the stack is : %d",peek() );
 break;

case 5:
printf("Length of the queue is : %d", length());
break;

case 6:
exit(0);

}
}
return 0;
}