Skip to main content

Insert node at specific position N in circular link list

Now we will see how to insert a new node at position N in circular link list.

Algorithm for insertion at position N in circular link list:

In this algorithm, TAIL is pointer to the last node of the list and PTR is node to be inserted. The step are as below :
  • Create new node PTR
  • Set the info field of PTR
  • If list have no nodes i.e. (TAIL == NULL)
    • If (POS == 1)
      • Set PTR->NEXT = PTR
      • Set TAIL = PTR
    • Else
      • Invalid POS. Node can't be inserted
    • End If;
  • Else if (POS == 1) (Now list is not empty also)
    • Set PTR->NEXT = TAIL->NEXT
    • Set TAIL->NEXT = PTR
  • Else
    • Set TEMP = TAIL->NEXT
    • Traverse the list for (POS-1)th node of list into TEMP
    • If TEMP == TAIL
      • Set PTR->NEXT = TAIL->NEXT
      • Set TAIL->NEXT = PTR
      • Set TAIL = PTR
    • Else
      • Set PTR->NEXT = TEMP->NEXT
      • Set TEMP->NEXT = PTR
    • End If;
  • End If;



Function to insert node at position N in circular link list:


void insertAtPosition(NODE **tail, int info, int pos){
 NODE *ptr = (NODE*) malloc(sizeof(NODE));
 ptr->info = info;
 NODE *temp;
 if(pos < 1){ 
  printf("Error: Position can't be 0 or negative\n"); 
  return; 
 } 
 if(*tail == NULL){ 
  if(pos == 1){ 
   ptr->next = ptr;
   *tail = ptr;
  }
  else{
   printf("\nList is empty. Invalid position\n");
  }
 }
 else if(pos == 1){
  ptr->next = (*tail)->next;
  (*tail)->next = ptr;
 }
 else{
  temp = (*tail)->next;
  for( int i = 2; i < pos; i++){ temp = temp->next;
   if(temp == (*tail)->next){
    printf("\nError: Invalid position\n");
    return;
   }
  }
  if(temp == *tail){
   ptr->next = (*tail)->next;
   (*tail)->next = ptr;
   *tail = ptr;
  }
  else{
   ptr->next = temp->next;
   temp->next = ptr;
  }
 }
}

Program to insert at position N in the singly link list:


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

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

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

int main(){
 
 NODE *tail = NULL;
 
 insertAtFirst(&tail, 1);
 insertAtFirst(&tail, 3);
 insertAtFirst(&tail, 4);
 traverse(&tail);

 insertAtPosition(&tail, 9, 0);
 traverse(&tail);
 
 insertAtPosition(&tail, 9, 1);
 traverse(&tail);
 
 insertAtPosition(&tail, 44, 3);
 traverse(&tail);
 
 insertAtPosition(&tail, 89, 6);
 traverse(&tail);
 
 insertAtPosition(&tail, 89, 8);
  
 return 0;
 
}

void insertAtPosition(NODE **tail, int info, int pos){
 NODE *ptr = (NODE*) malloc(sizeof(NODE));
 ptr->info = info;
 NODE *temp;
 if(pos < 1){ 
  printf("Error: Position can't be 0 or negative\n"); 
  return; 
 } 
 if(*tail == NULL){ 
  if(pos == 1){ 
   ptr->next = ptr;
   *tail = ptr;
  }
  else{
   printf("\nList is empty. Invalid position\n");
  }
 }
 else if(pos == 1){
  ptr->next = (*tail)->next;
  (*tail)->next = ptr;
 }
 else{
  temp = (*tail)->next;
  for( int i = 2; i < pos; i++){ temp = temp->next;
   if(temp == (*tail)->next){
    printf("\nError: Invalid position\n");
    return;
   }
  }
  if(temp == *tail){
   ptr->next = (*tail)->next;
   (*tail)->next = ptr;
   *tail = ptr;
  }
  else{
   ptr->next = temp->next;
   temp->next = ptr;
  }
 }
}

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);
 }
 printf("\n");
}



4  3  1
Error: Position can't be 0 or negative
4  3  1
9  4  3  1
9  4  44  3  1
9  4  44  3  1  89

Error: Invalid position

Related topics:



Labels:

Comments

Post a Comment

Popular posts from this blog

Link List

In computer science, a linked list is a linear collection of elements, called nodes, each node have info field and next field pointing to the next node by means of a pointer. It is a data structure consisting of a group of nodes in sequence and connected with links. In simplest form of this data structure, each node is consist of data and a reference (in other words, a link) to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration. Types of Link List Singly Link List: Insert node at first position in singly link list Insert node at last position in singly link list Insert node at specific position in singly link list Delete node at first position in singly link list Delete node at last position in singly link list Delete node at specific position in singly link list Find number of nodes in singly link list Dublication of singly link list Concatenation of two singly link list So...
Post a Comment
Read more

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 printi...
Post a Comment
Read more

Deletion of node at specific position N in circular link list

Now we will see how to delete node at position 'N' in circular link list. Algorithm to delete node at position 'N' in circular link list: In this algorithm, TAIL points to last node of the link list and POS is position where the new node to be deleted. The steps are as follows: Initialize TEMP and TEMP2 If list have no node or position is less than one  (TAIL == NULL or POS < 1) Node cannot be deleted Else If (POS == 1) If list have one node   (TAIL->NEXT == TAIL) Delete TAIL   (TAIL = NULL) Else Delete the first node   (TAIL->NEXT = TAIL->NEXT->NEXT) End If; Else Set TEMP = TAIL->NEXT   (TEMP now points to first node) Traverse the list for (POS-1)th node using TEMP If node to be deleted is last node i.e. (TEMP->NEXT == TAIL) Set TAIL = TEMP End If; Set TEMP->NEXT = TEMP->NEXT->NEXT End If; End If;     Function to delete node at position 'N' in circular link list: int deleteAtPosition(NODE **tail, ...
Post a Comment
Read more