Skip to main content

Deletion of first node in circular link list

Deletion of first node from the circular link list requires that the list has at least one node. It is error to delete a node doesn't exist. In this process, last node's next pointer is updated to point to second node of the list. Now we will see the algorithm to delete node at first position in circular link list.

Algorithm to delete first node in circular link list:

The algorithm uses TAIL as pointer to the last node of circular list and TEMP is temporary pointer that help in deletion process. The steps are as follows:
  • Declare TEMP
  • If list have only one node
    • FREE (TAIL)
    • TAIL = NULL
  • Else
    • TEMP = TAIL->NEXT  [TEMP will point to first node]
    • TAIL->NEXT = TAIL->NEXT->NEXT [TAIL's next will now point to second node]
    • Free (TEMP) [free the first node]
  • End If;

Function to delete node at first position in circular link list:

The function takes pointer to last node as input and return info part of the list if no error occur, otherwise returns -1 after printing error massage:

int deleteFirst(NODE **tail){
 NODE *temp;
 int info = -1;
 if(*tail == NULL){
  printf("\nError : List have no node");
 }
 else{
  if(*tail == (*tail)->next){ // one node
   temp = *tail;
   *tail = NULL;
  }
  else{
   temp = (*tail)->next;
   (*tail)->next = (*tail)->next->next;
  }
  info = temp->info;
  free(temp);
 }
 return info;
}

Program to delete node at first position in the circular link list:


#include <stdio.h>
#include <malloc.h>

struct node{
 int info;
 struct node *next;
};
typedef struct node NODE;

void insertAtFirst(NODE **, int);
int deleteFirst(NODE **);
void traverse(NODE **);

int main(){
 
 NODE *tail = NULL;
 
 insertAtFirst(&tail, 1); //1
 insertAtFirst(&tail, 2); //2  1 
 insertAtFirst(&tail, 3); //3  2  1
 traverse(&tail); // 3 2  1
 printf("\n");
 deleteFirst(&tail); // 2  1
 traverse(&tail);
 
 printf("\n");
 deleteFirst(&tail); // 1
 traverse(&tail);
 
 deleteFirst(&tail); // 
 deleteFirst(&tail); // no nodes
 traverse(&tail);
 
 return 0;
}

int deleteFirst(NODE **tail){
 NODE *temp;
 int info = -1;
 if(*tail == NULL){
  printf("\nError : List have no node");
 }
 else{
  if(*tail == (*tail)->next){ // one node
   temp = *tail;
   *tail = NULL;
  }
  else{
   temp = (*tail)->next;
   (*tail)->next = (*tail)->next->next;
  }
  info = temp->info;
  free(temp);
 }
 return info;
}

void insertAtFirst(NODE **tail, int info){
 NODE *ptr = (NODE*) malloc(sizeof(NODE));
 ptr->info = info;
 if(*tail == NULL){
  ptr->next = ptr;
  *tail = ptr;
 }
 else{
  ptr->next = (*tail)->next;
  (*tail)->next = ptr;
 }
}

void traverse(NODE **tail){
 NODE *temp;
 temp = *tail;
 if(*tail){
  do{
   printf("%d  ", temp->next->info);
   temp = temp->next;
  } while(temp != *tail);
 }
}



3  2  1
2  1
1
Error : List have no node

Related topics:



Labels:

Comments

Post a Comment

Popular posts from this blog

Prefix to Infix Conversion

With a given Prefix Expression, we will see how to convert Prefix Expression into Infix Expression using stack.   Algorithm to convert Prefix Expression to Infix Expression: In this algorithm, we will use stack to store operands during the conversion. The step are as follows: Read the prefix string While the end of prefix string scanned from right to left symb = the current character If symb is an operator poped_sym1 = pop the stack poped_sym2 = pop the stack concat the string  STR = ( poped_sym1 )+ ( operator )+( poped_sym2 ) push the string STR into stack Else push the operand symb into stack End If End While infix_str = pop the stack   Function to convert Prefix Expression to Infix Expression: void prefix_to_infix(char prefix[], char infix[]){ char op[2]; //operator string char poped1[MAX]; char poped2[MAX]; char temp[MAX]; int i = strlen(prefix); op[1] = '\0'; while(--i != -1){ if(prefix[i] == ' '){ continue; } if(isoper
Post a Comment
Read more

Circular Doubly Link List

Circular Doubly Link List is data structure which contains a list of node containing info part and links to the next and previous node. In CDLL, last node's next pointer points to the first node and first node's previous pointer points to last node of the list. This  makes traversal in both direction of CDLL.  Before going to discuss the operation on circular doubly link list, we will first see the basic structure of the data type and see how it could be represented in c programming. First we will see the how the node or element of circular doubly link list is represented. See the image below: The component of circular doubly list node: info : It contains the actual information next : This field points to the next node in the list prev  : This field points to the previous node in the list Now we see how the circular doubly link list is represented. See the image below: The component of circular doubly link list are: START  pointer points to the first node of the lis
Post a Comment
Read more

Insert node at last position in doubly link list

Now we will see how to insert a new node at the last position of doubly link list. Algorithm for insertion at last position in doubly link list: In this algorithm, START is pointer to first node of list and PTR is the node to be inserted at last. The steps are as follows: Create new node PTR Set the info field of PTR Set PTR->NEXT = NULL If list is empty i.e. START == NULL Set START = PTR Set PTR->PREV = NULL Else Traverse the list for last node into TEMP pointer Set PTR->PREV = TEMP Set TEMP->NEXT = PTR End If;     Function to insert node at last position in doubly link list: void insertAtLast(NODE **start, int info){ NODE *ptr = (NODE*) malloc(sizeof(NODE)); NODE *temp = *start; ptr->info = info; ptr->next = NULL; if(*start == NULL){ *start = ptr; ptr->prev = NULL; } else{ while(temp->next != NULL){ temp = temp->next; } ptr->prev = temp; temp->next = ptr; } }   Program to insert at last position in the do
Post a Comment
Read more