Linear_queue_&_Queue_as_a_list

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define size 100
char queue[size];
int front = 0,rear = -1;
void enqueue()
{
    if(rear == size-1){
        printf("The Queue is Overflow\n");
    }
    else{
    rear ++;
    printf("Enter the item to enqueue \n");
    scanf(" %c",&queue[rear]);
}
}
void dequeue()
{
    if(rear == -1)
    {
        printf("No items to dequeue\n");
    }
    else
    {
        front = front + 1;
    }
}
void traverse()
{
    int i;
    for(i=front;i<=rear;i++){
        printf("\n%c  ",queue[i]);
    }
    printf("\n");
}
void enqueuel()
{
    if(rear == size-1){
        printf("The Queue is Overflow\n");
    }
    else{
    rear ++;
    printf("Enter the item to enqueue \n");
    scanf(" %c",&queue[rear]);
}}
void dequeuel()
{
    int rm = 0;
    for (rm = 0 ;rm<=rear;rm++)
    {
        queue[rm]=queue[rm+1];
    }
    rear = rear -1;
}
    int main(){
int select =0,choose =0;
label:
printf("Press \n 1.Linear Queue \n 2.Queue as a list \n 3.exit \n");
scanf(" %d",&choose);
if (choose == 3){
    goto last;
}
if (choose == 1){
while(select!=5){
printf("Press \n 1.Enqueue \n2.Dequeue \n 3.Traverse \n 4.Main Menu \n 5.Exit the program \n");
scanf(" %d",&select);
switch(select)
{
    case 1:
    enqueue();
    break;
    case 2:
    dequeue();
    break;
    case 3:
    traverse();
    break;
    case 4:
    goto label;

}}
if(front == size - 1){
    front =-1;
    rear = -1;
}
}
else{
while(select!=5){
printf("Press \n 1.Enqueue \n2.Dequeue \n 3.Traverse \n 4.Main Menu \n 5.Exit the program \n");
scanf(" %d",&select);
switch(select)
{
    case 1:
    enqueuel();
    break;
    case 2:
    dequeuel();
    break;
    case 3:
    traverse();
    break;
    case 4:
    goto label;
}}

}
last :
        return 0;
}