Doubly Link List Full (muftY(bugless))

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

data *head=NULL;
data *tail=NULL;


void ins_at_first(int x)
{
    data *new_node=(data*)malloc(sizeof(data));
    new_node->a=x;
    new_node->next=NULL;
    new_node->prev=NULL;

    if(head==NULL)

    {
        head=new_node;
        return;
    }
    new_node->next=head;
    head->prev=new_node;
    head=new_node;

    return;
}
void ins_at_end(int x)
{
    data *new_node=(data*)malloc(sizeof(data));
    new_node->a=x;
    new_node->next=NULL;
    new_node->prev=NULL;

    if(head==NULL)
    {
        head=new_node;
        return;
    }
    data *temp=head;
    while(temp->next!=NULL)
    {
        temp=temp->next;
    }
    new_node->prev=temp;
    temp->next=new_node;

    return;
}

void ins_at_nth(int n, int x)
{
    data *new_node=(data*)malloc(sizeof(data));
    new_node->a=x;
    new_node->next=NULL;
    new_node->prev=NULL;

    if(head==NULL)
    {
        head=new_node;
        return;
    }

    if(n==1)
    {
        new_node->next=head;

        head=new_node;

        return;
    }

    data *temp=head;
    n=n-2;

    while(n--)
    {
        temp=temp->next;
        if(temp->next==NULL)
        {
            new_node->prev=temp;
            temp->next=new_node;
            tail=new_node;
            return;
        }
    }
    temp->next->prev=new_node;
    new_node->next=temp->next;
    new_node->prev=temp;
    temp->next=new_node;

    return;



}

void del_by_pos(int n)
{

    if(head==NULL) //jokhn kicui nai
    {
        printf("     List Empty\n");
        return;
    }
    if(n==1) //jokhn n er man 1 dewa hy
    {
        data *del=head;
        if(head->next==NULL) //jokhn n er man 1 dewa hy ebng list e oi ekti matroi node cilo
        {
            head=NULL;
            tail=NULL;
            free(del);
            return;
        }
        head=head->next;
        head->prev=NULL;
        free(del);
        return;


    }
    data *temp=head;
    n=n-2;

    while(n--)
    {
        temp=temp->next;
        if(temp->next==NULL) //jodi node sonkhar besi n er man dewa hy then ei "if" kaj korbe
                            //(mane node ache 5ta . ami n=100 tomo node dlt korte cai then)
        {
            printf("\n    Invalid Position\n");
            return;
        }

    }
    data *del=temp->next;
    if(del->next==NULL) // list er last node dlt korar khetre
    {

        tail=temp;
        temp->next=NULL;
        free(del);
        return;
    }
    del->next->prev=temp; //list er moddher savabik node dlt korte bakituku.
    temp->next=del->next;
    free(del);
}

void del_by_value(int x)
{
    if(head==NULL)
    {
        printf("\n    List was empty previously\n");
        return;
    }
    if(head->a==x)
    {

        data *del=head;

        if(head->next==NULL)
        {
            head=NULL;
            tail=NULL;
            free(del);
            return;
        }
        head=head->next;
        head->prev=NULL;
        free(del);
        return;
    }


    data *temp=head;
    while(temp->next->a!=x)
    {
        temp=temp->next;
        if(temp->next==NULL)
        {
            printf("\n    No Such Value in this current List\n");
            return;
        }
    }
    data *del=temp->next;
    if(del->next==NULL)
    {
        tail=temp;
        tail->next=NULL;
        free(del);
        return;
    }
    del->next->prev=temp;
    temp->next=del->next;
    free(del);
    return;
}


void reset()
{
    data *temp=head;
    while(temp!=NULL)
    {
        data *del=temp;

        temp=temp->next;
        free(del);
    }
    head=NULL;
    tail=NULL;
    return;
}

void print()
{
    data *temp=head;
    if(head==NULL)
    {
        printf("Empty\n");

    }

    while(temp!=NULL)
    {
        printf("%d ",temp->a);
        temp=temp->next;
    }
    printf("\n");
}

int main()
{
    int a,v,w,x,n,m,o;
    while(1)
    {
        printf("1.Insert At First\n");
        printf("2.Insert At End\n");
        printf("3.Insert At n_th Position\n");

        printf("4.Delete By Position\n");
        printf("5.Delete By Value\n");

        printf("8.Print\n");
        printf("9.RESET LINK LIST\n");

        printf("\n ###0 for Al-Bida###\n");
        printf("\n             Command:");
        scanf("%d",&w);
        if(w==1)
        {
            printf("\nEnter an integer Number:");
            scanf("%d",&x);
            ins_at_first(x);
             printf("\n");

        }
        if(w==2)
        {
            printf("\nEnter an integer Number:");
            scanf("%d",&x);
            ins_at_end(x);
             printf("\n");
        }
        if(w==3)
        {
            printf("\nDeclear The Position:");
            scanf("%d",&n);
            printf("Enter an integer Number:");
            scanf("%d",&x);
            ins_at_nth(n,x);
             printf("\n");
        }

        if(w==4)
        {
            printf("\nDeclear The Specific Position:");
            scanf("%d",&n);

            del_by_pos(n);
             printf("\n");

        }
         if(w==5)
        {
            printf("\nDeclear The Value:");
            scanf("%d",&n);
            del_by_value(n);
             printf("\n");
        }


        if(w==8)
        {
            printf("\n            Result: ");
            print();
            printf("\n");
        }

        if(w==9)
        {
            printf("\n      Reseted Successfully\n");
            reset();
             printf("\n");
        }

        if(w==0)
        {
            printf("\n    Jajakalla_khayer..[muftY]\n");
             printf("\n");
            break;
        }
    }
}