Queue(Array)

#include<stdio.h>
#include<memory.h>
#include<stdlib.h>

#define SIZE 7
int front = -1, rear = -1, queue[SIZE];
void menu();
void enqueue();
void dequqeue();
void peek();
void display();
int main(){
	int choice=0;
	do{
		system("cls");
		menu();
		printf("Enter your choice:");
		scanf("%d",&choice)
		switch(choice){
			case 1: enquqeue();
					break;
			case 2: dequeue();
					break;
					
			case 3: peek();
					break;
					
			case 4: display();
					break;
				
			default: printf("Thank you for sharing this program");
					 break;
		}
		getch();
	}while(choice>0 && choice<5);
	return 0;
}
void menu(){
	printf("=========================================================\n");
	printf("                          Menu                           \n");
	printf("=========================================================\n");
	printf("->Enter 1 for enqueue operation\n");
	printf("->Enter 2 for dequeue operation\n");
	printf("->Enter 3 for peek operation\n");
	printf("->Enter 4 for display operation\n");
	printf("=========================================================");
}
void enqueue(){
	int value=0;
	printf("Enter your data:");
	scanf("%d",&value);
	if(rear == SIZE-1){
		printf("Queue overflowed");
		menu();
	}
	else if(front == -1 || rear == -1){
		front = rear = 0;
		queue[front] = value;
	}else{
		rear++;
		queue[rear] = value;
	}
}
void dequeue(){
	int value=0;
	if(front== -1 || front>rear){
		printf("Underflow");
	}
	else{
		value = queue[front];
		printf("Deleted value is %d",value);
		front++;
	}
void peek(){
	if(front == -1 || front>rear){
		printf("Underflow");
	}
	else{
		printf("%d",queue[front]);
	}
}

void display(){
	if(front==-1 || front>rear){
		printf("Queue is empty");
	}
	else{
		int i=0;
		for(i=front;i<=rear;i++){
			printf("%d->",queue[i]);
		}
	}
}