// assumin all things are given function to delete 
from                beginning.....



int delete_from_beg()
 {
   int el;
   if(head==NULL)
     {
       printf("\n can't delete ");
       return -1;
     }
  else
   {
      struct doubly *temp;
      temp=head;
      el=temp->info;
      head=temp->next;
      temp->next=NULL;
      head->prev=NULL;
      return el;
   }

 }



//delete from end


int delete_from_end()
 {
    int el;
    if(head==NULL)
       {
	 printf("\n can't delete");
	 return -1;
       }
    else
    {
      struct doubly *temp;
      temp=head;
      while(temp->next!=NULL)
       temp=temp->next;
      el=temp->info;
      if(temp==head)
	head=NULL;
      else
	temp->prev->next=NULL;
      return el;
    }
 }




// delete from any position



int delete_at_pos(int item)
 {
   int el,flag=0;
   struct doubly *temp;
   if(head==NULL)
     {
	printf("\n cant delete ");
	return -1;
     }
   else
     {
	temp=head;
	while(item>1)
	  {
	     item--;
	     temp=temp->next;
	     if(temp==NULL&& item>=1)
	       {
		 flag=1;
		 break;
	       }
	  }
	if(flag==1)
	 {
	    el=-1;
	    printf("\n cant delete at the specified 
location");
	 }
	else
	 {
	    if(temp==head)
	      {
		el=temp->info;
		head=temp->next;
	      }
	     else
	       {
		 struct doubly *t;
		 t=temp;
		 el=temp->info;
		 temp->prev->next=t->next;
		 temp->next->prev=t->prev;
	       }

	 }
     }
     return el;
 }




// where doubly is structure

struct doubly
 {
     int data;
     struct  doubly *prev,*next;
};

dsgfdagfdg
[op;iop

to delete an element.
enter the position of the element to be deleted.
-> pos.

structure of node is 

struct node
{
  int data;
  struct node *prev , *next;
}

//home is the starting pointer of hte list.
struct node * delete(struct node *home , int pos)
{
  temp = home;
  if(pos == 1)
  {
    temp = home;
    home = home -> next;
    free(temp);
  }

  temp = home;
  p = home;
  
   for(i = 0 ; i < pos ; i++)
   {
     p = p -> next;
   }

   temp = p -> next;
  temp1 = temp -> next;

  p -> next = temp1;
  temp1 -> prev = p
  
  free(temp);
}

return home;
}

typedef int info_t;
typedef struct element
{
        info_t info;
        struct element *next;
        struct element *prev;
}node;
typedef node* nodep;


Function to delete a node:

void del_node(nodep p)
{
	(p->prev)->next=p->next;
	(p->next)->prev=p->prev;
	free(p);
}