Insertion at last position in singly link list

To insert a node at last position of singly list, we need to traverse the list using some temporary pointer so that temporary pointer points to last node of that list. After getting last node into temp, it's next pointer is updated to point to the new node that is to be inserted at last. After that, the next pointer of new node is set to point to nothing for indicating end of the list as it is inserted at last. Here is the algorithm to inserted node at last position of singly link list:

Algorithm to insert node at last position in singly link list:

Create new node PTR
Set the INFO field of PTR
Set PTR->NEXT = NULL
If the list has no nodes i.e. [START = NULL]
- Make START point to new node PTR i.e. [START = PTR]
Else
- Traverse the list using TEMP, so that it points to last node
- Make last node's NEXT point to new node PTR i.e. [TEMP->NEXT = PTR]
End If

Function to insert node at last position in singly 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;
 }
 else
 {
  while(temp->next != NULL){
   temp = temp->next;
  }
  temp->next = ptr; //last node point to new node ptr
 }
}

Program to insert node at last position in the singly link list:


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

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

void insertAtLast(NODE **, int);
void traverse(NODE **);

int main(){
 
 NODE *start = NULL;
 
 insertAtLast(&start, 22);
 insertAtLast(&start, 40); 
 insertAtLast(&start, 55); 
 traverse(&start);
 return 0;
}

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;
 }
 else
 {
  while(temp->next != NULL){
   temp = temp->next;
  }
  temp->next = ptr; //last node point to new node ptr
 }
}

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

Output:

22  40  55

Comments

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-...

Concatenating two link list

Here we will see how to concat two single link list into other link list. First we copy the content of first list in third list and then the content of second list into third list. Algorithm for concatenation of two link list: This algorithm will use three list. List 1 and List 2 will be concatenated into List 3. The step below: Copy the list 1 into list 3 Copy the list 2 at the last of list 3 Function to concat two link list: void concatLists(NODE **start1, NODE **start2, NODE **mergeinto){ NODE *temp; temp = *start1; while(temp != NULL){ insertAtLast(&*mergeinto, temp->info); temp = temp->next; } temp = *start2; while(temp != NULL){ insertAtLast(&*mergeinto, temp->info); temp = temp->next; } } Program to concat two link lists: #include <stdio.h> #include <malloc.h> struct node{ int info; struct node *next; }; typedef struct node NODE; void insertAtLast(NODE **, int); void traverse(NODE **); void concatLists(NODE **,...

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...

The CS Point

Search This Blog