Quewe full lab 8 tarik

#include<stdio.h>
#include<stdlib.h>
struct node
{
    int data;
    struct node *next;
};

void insertion(struct node *f,struct node *r,int vv);
void display(struct node *f);
void deletion(struct node *f,struct node *r);
void Count(struct node *f);

int main()
{
int v,c;
struct node *front, *rear;
front=(struct node *) malloc(1*sizeof(struct node));
rear=(struct node *) malloc(1*sizeof(struct node));
front->data=0;
front->next=NULL;
rear->data=0;
rear->next=NULL;
 while(1)
    {
        printf("\n----------Menu-----------\n");
        printf("\n Press 1 for insertion\n");
        printf("\n Press 2 for deletion\n");
        printf("\n Press 3 for display\n");
        printf("\n Press 4 for Count\n");
        printf("\n Press 0 for quite\n");
        printf("\n Enter your choice\n");
        scanf("%d",&c);
        switch(c)
        {
            case 0:exit(0);
            break;

            case 1:printf("\n choice = insertion \n");
            printf("\n Enter new value \n");
            scanf("%d",&v);
            insertion(front,rear,v);
            break;

            case 2:printf("\n choice=deletion\n");
            if(front->next!=NULL)
            deletion(front,rear);
            else
              printf("\n The quewe is empty\n");
              break;

            case 3:printf("\nchoice = display\n");
            if(front->next!=NULL)
                display(front);
            else
                printf("\nThe queue is empty\n");
            break;

            case 4: printf("\n choice=Count\n");
            Count(front);
            break;

            default: printf("\n Wrong position\n\n");
            break;
        }

    }
}

void insertion(struct node *f,struct node *r,int vv)
{

    struct node *temp;
    temp=(struct node *) malloc(1*sizeof(struct node));
    temp->data=vv;
    temp->next=NULL;
    if(f->next==NULL)
    {
        f->next=temp;
        r->next=temp;
    }
    else
    {
      r->next->next=temp;
      r->next=temp;
    }
}

void display(struct node *f)
{
    while(f->next!=NULL)
    {
        printf("\t%d",f->next->data);
        f=f->next;
    }
}

void deletion(struct node *f,struct node *r)
{
    struct node *temp;
    temp=f->next;
    if(f->next==r->next)
    {
        f->next=NULL;
        r->next=NULL;
    }
    else
    f->next=temp->next;
    printf("\n the deleted node=%d\n",temp->data);
    free(temp);
}

void Count(struct node *f)
{
    int t=0;
    while(f->next!=NULL)
    {
        t=t+1;
        f=f->next;
    }
    printf("\n total node=%d\n",t);
}