Programming Question

Write a function code for delete node from mid in Doubly Circular Linked List

struct Node *deleteFromMid(struct Node *s){
	 struct Node *p,*t;
	 int i,pos;
	 printf("Enter position:");
	 scanf("%d",&pos);
	 t=s;
	 for(i=1;i<=pos-1;i++){
	   p=t;
	   t=t->next;
	 }
         ...

Write a function code for delete node from front in Doubly Circular Linked List

struct Node * deleteFromFront(struct Node *s){
	 struct Node *t,*p;
	 p=t=s;
	 while(p->next != s){
	   p=p->next;
	 }
         ...

Write a function code for insert node at last in Doubly Circular Linked List

struct Node * insertAtLast(struct Node *s) {
	 struct Node *p,*t;
	 p=s;
	 while(p->next != s){
	   p=p->next;
	 }
         ...

Write a function code for insert node at mid in Doubly Circular Linked List

 struct Node * insertAtMid(struct Node *s) {
	 struct Node *p,*t;
	 int i,pos;
	 p=s;
	 printf("Enter position:");
	 scanf("%d",&pos);
	 for(i=1;i<=pos-2;i++){
	   p=p->next;
	 }
         ...

Write a function code for insert node at front in Doubly Circular Linked List

struct Node * insertAtFront(struct Node *s) {
	  struct Node *t,*p;
	  t=allocate();
	  printf("Enter Data:");
	  scanf("%d",&t->data);
	  p=s;
          while(p->next != s){
               p = p->next;
          }
          ...

Manish Shandilya