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

typedef struct node
{
    int a;
    char ch;
    struct node *next;
    struct node*previous;

} node;

node *head;
void display()
{

    node *list=head;
    while(list !=NULL)
    {
        printf("\n\nA= %d ,C= %c\n",list->a,list->ch);


        list=list->next;

    }
}
void insert_at_end(int aN,char chN)
{

    node*N=(node*)malloc(sizeof(node));
    N->a=aN;
    N->ch=chN;
    N->next=NULL;
    N->previous=NULL;
    node*list=head;
    if(head==NULL)
    {
        head=N;
    }
    else
    {
        while(list->next!=NULL)
        {
            list=list->next;
            N->previous=list;
        }
        list->next=N;
        N->next=NULL;
        N->previous=list;


    }

}

void delete_pos(int pos)
{
    node *list=head,*temp=NULL;
    int x=0;
    if(pos==1)
    {
        head=list->next;
        head->previous=NULL;
        free(list);
        return;
    }
    else
    {
        pos=pos-2;
        while(pos!=0)
        {
            list=list->next;
            pos--;
            if(list==NULL)
            {return;}
            else{
                temp=list;

                list->previous->next=NULL;
                list=list->previous;
                free(temp);
            }

        }
        temp=list->next;
        list->next=temp->next;
        temp->next->previous=list;

        free(temp);
        x=1;
    }

    if(x==1)
    {
        printf("KEY IS DELETED \n\n");
    }
}
int main()
{
    head=NULL;
    insert_at_end(5,'p');
    insert_at_end(4,'r');
    insert_at_end(2,'u');
    delete_pos(3);

    display();

}