MUKHERJEE's First linked list

#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int a;
    char ch;
    struct node *next;
} node;
node *head;
void display()
{
    node *list=head;

    if(head==NULL)
    {
        printf("\n\n\tNode is empty!!\n\n");
        printf("\tENTER DATA PLEASE!!\n");
        MENU();

    }
    while(list !=NULL)
    {
        printf("\n\n\tA= %d ,C= %c\n",list->a,list->ch);
        list=list->next;
    }
}
void create()
{
    int value;
    char ch;
    while(1)
    {
        printf("   \n\tENTER  NUMBER & Character (int,char) (-1 for exit)\n");
        printf("\t");
        scanf("%d",&value);
        if(value==-1)
        {
            display();
            printf("\tNode Create Completed!!");
            MENU();
        }
        scanf(" %c",&ch);
        insert_end(value,ch);
        }
}
void insert_first(int aN,char chN)
{
    node*p=(node*)malloc(sizeof(node));
    p->a=aN;
    p->ch=chN;
    p->next=NULL;
    if(head==NULL)
    {
        head=p;
        return;
    }
    else
    {
        p->next=head;
        head=p;
    }
}
void insert_nth(int n,int aN,char chN)
{
    node *N=(node*)malloc(sizeof(node));
    N->a=aN;
    N->ch=chN;
    N->next=NULL;
    if(n==1)
    {
        N->next=head;
        head=N;
        return;
    }
    else
    {
        node*list=head;
        n=n-2;
        while(n!=0&&list->next!=NULL)
        {
            list=list->next;
            n--;
        }
        N->next=list->next;
        list->next=N;
    }
}
void insert_end(int aN,char chN)
{
    node *N=(node*)malloc(sizeof(node));
    N->a=aN;
    N->ch=chN;
    N->next=NULL;
    node *list=head;
    if(head==NULL)
    {
        head=N;
        list=N;
    }
    else
    {
        while(list->next!=NULL)
        {
            list=list->next;
        }
        list->next=N;
    }
}
int search()
{
    int n;
    printf("   \n\tSEARCH VALUE\n\n");
    printf("\tEnter Any Value For Search :");
    scanf("%d",&n);

    node*list=head;
    int x=0;
    while(list!=NULL)
    {
        if(list->a==n)
        {
            printf("\n\t%d is Found\n\n",n);
            x=1;
            break;
        }
        else

            list=list->next;
    }
    if(x==0)
    {
        printf("\n\t%d isn't found\n\n",n);
    }
    MENU();
}
void addnode()
{
    int af,y;
    char cf;
    printf("\n\n\n");
    printf("\t1.  Insert At First.\n");
    printf("\t2.  Insert At LAST.\n");
    printf("\t3.  Insert At Nth Position.\n");
    printf("\t4.  GO to menu\n");
    printf("\n\tChoose from (1-4):");
    int x;

    scanf("%d",&x);
    switch(x)
    {
    case 1:
    {
        printf("\n\tInsert At First(int,char)\n");

        printf("\t");
        scanf("%d",&af);
        scanf(" %c",&cf);
        insert_first(af,cf);
        display();
        addnode();

    }
    case 2:
    {
        printf("\n\tInsert At End(int,char)\n");


        printf("\t");
        scanf("%d",&af);
        scanf(" %c",&cf);
        insert_end(af,cf);
        display();
        addnode();

    }
    case 3:
    {
        printf("\n\t<<Insert At Nth(pos,int,char)>>\n");

        printf("\t");
        scanf("%d",&y);
        scanf("%d",&af);
        scanf(" %c",&cf);
        insert_nth(y,af,cf);
        display();
        addnode();

    }
    case 4:
    {
        MENU();
        break;
    }
    default:
    {
        printf("\tChoose a Correct Option\n");
        addnode();
    }
    }
}
void delete()
{

    printf("\n\tDELETE NODE\n");
    printf("\t1.Delete By Position \n");
    printf("\t2.Delete By Value \n");
    printf("\t3.Go to menu\n\n");
    printf("\tChoose from (1-3):");
    int x,s,l;
    scanf("%d",&x);
    switch(x)
    {
    case 1:
    {
        printf("   \n\tDELETE BY POSITION\n");
        printf("\t");
        printf("Enter Position -");
        scanf("%d",&s);
        delete_pos(s);
        delete();
    }
    case 2:
    {
        printf("   \n\tDelete by value\n");
        printf("\t");
        printf("Enter value-");
        scanf("%d",&l);
        delete_item(l);
        delete();
    }
    case 3:
    {
        MENU();
        break;
    }
    default:
    {
        printf("\tChoose a correct option\n");
        delete();
    }
    }
}
void delete_pos(int pos)
{
    node *list=head,*temp=NULL;
    int x=0;
    if(pos==1)
    {
        head=head->next;
        free(list);
        return;
    }
    pos=pos-2;
    while(pos!=0)
    {
        list=list->next;
        pos--;
        if(list==NULL)
            return;
    }
    temp=list->next;
    list->next=temp->next;
    x=1;
    free(temp);
    if(x==1)
    {
        printf("\tKey is already deleted\n\n");
    }
    else
    {
        printf("\tKey isn't found\n");
    }

}
void delete_item(int value)
{
    node *list = head, *temp=NULL;
    int x = 0;

    while(list!=NULL)
    {
        if(list->a==value)
        {
            if(temp==NULL)
                head = list->next;
            else
                temp->next = list->next;

            printf("\t%d is already deleted from list\n", value);
            x = 1;
            free(list);
            break;
        }
        temp = list;
        list = list->next;
    }
    if(x==0)
        printf("Key not found!\n");

}
void MENU()
{

    printf("\n\n\tLinked List ( SINGLY )\n\n");
    printf("\t1.   make nodes--->\n");
    printf("\t2.   add nodes--->\n");
    printf("\t3.   search nodes--->\n");
    printf("\t4.   delete nodes--->\n");
    printf("\t5.   display--->\n");
    printf("\t6.   exit--->\n\n\n");

    printf("\tChoose from (1-5)--->");
    int x;
    scanf("%d",&x);
    switch(x)
    {
    case 1:
    {
        create();
        break;
    }
    case 2:
    {
        addnode();
        break;
    }
    case 3:
    {
        search();
        break;
    }
    case 4:
    {
        delete();
        break;
    }
    case 5:
    {
        dis();
        break;
    }
    case 6:
    {
        break;
    }
    default:
    {
        printf("Choose a option which is correct-\n");
        MENU();
    }
    }
}
void dis()
{
    node *list=head;
    if(head==NULL)
    {
        printf("\n\n\tNode is empty!!\n\n");
        printf("\tenter data!!\n");
        MENU();
    }
    while(list !=NULL)
    {
        printf("\n\n\tA= %d ,C= %c\n",list->a,list->ch);
        list=list->next;
    }
    MENU();
}
int main()
{
    head=NULL;
    MENU();
}