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

Insertion at specific position N in singly link list

Insertion of a new node at position N in singly link list requires traversing the list for N-1 th node so that links are updated to accommodate the new node in the list. The new node's next is set to point to Nth node of the list and then N-1 th node's next pointer is updated so that it reference to new node. The step by step algorithm to insert node at Nth position is as below: Algorithm to insert node at specific position N in singly link list: This algorithm will insert the new node PTR at the position N in the link list. The steps are as follows: Create new node PTR Set the INFO field of PTR If N is less than 1 Node can't be inserted Else If node is to be inserted at first i.e. [N=1] Make new node PTR points to first node i.e. [PTR->NEXT = START] Make START point to new node PTR i.e. [START = PTR] Else Traverse the list to get the (N-1)th node of list into TEMP Make PTR's next pointer point to Nth node in the list i.e. [PTR -> NEXT  =  TEMP-...
Post a Comment
Read more

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

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