Insertion in Linked List

Try it on GfG Practice

Insertion in a linked list involves adding a new node at a specified position in the list. There are several types of insertion based on the position where the new node is to be added:

• At the front of the linked list  
• Before a given node.
• After a given node.
• At a specific position.
• At the end of the linked list.

1. Insert a Node at the Front/Beginning of the Linked List

To insert a new node at the front, we create a new node and point its next reference to the current head of the linked list. Then, we update the head to be this new node. This operation is efficient because it only requires adjusting a few pointers.

Algorithm:

• Make the first node of Linked List linked to the new node
• Remove the head from the original first node of Linked List
• Make the new node as the Head of the Linked List.

To read more about insert a new node at the front Refer, Insert a Node at Front/Beginning of a Linked List

2. Insert a Node after a Given Node in Linked List

If we want to insert a new node after a specific node, we first locate that node. Once we find it, we set the new node's next reference to point to the node that follows the given node. Then, we update the given node's next to point to the new node. This requires traversing the list to find the specified node.

Algorithm: 

• Initialize a pointer curr to traverse the list starting from head.
• Loop through the list to find the node with data equal to key.
  • If not found then return from function.
• Create a new node, say new_node initialized with the given data.
• Make the next pointer of new_node as next of given node.
• Update the next pointer of given node point to the new_node.

To read more about insert a new node after a specific node Refer, Insert a Node after a given Node in Linked List

3. Insert a Node before a Given Node in Linked List

If we want to insert a new node before a given node, we first locate that node while keeping the track of previous node also. Once we find it, we set the previous node's next reference the new node. Then, we update the node's next reference to point to the given node.

Algorithm:

• Traverse the linked list while keeping track of the previous node until given node is reached.
• Once node is found, allocate memory for a new node and set according to given data .
• Point the next pointer of the new node to node given node.
• Point the next pointer of the previous node to the new node.
• If given key is the head, update the head to point to the new node.

To read more about insert a new node before a given node Refer, Insert a node in Linked List before a given node

4. Insert a Node At a Specific Position in Linked List

To insert a new node at a specific position, we need to traverse the list to position - 1. If the position is valid, we adjust the pointers similarly such that the next pointer of the new node points to the next of current nod and next pointer of current node points to the new node.

Algorithm:

• Traverse the Linked list upto position-1 nodes.
• Once all the position-1 nodes are traversed, allocate memory and the given data to the new node.
• Point the next pointer of the new node to the next of current node.
• Point the next pointer of current node to the new node.

To read more about insert a new node at a specific position Refer, Insert a node at a specific position in a linked list

5. Insert a Node at the End of Linked List

Inserting at the end involves traversing the entire list until we reach the last node. We then set the last node's next reference to point to the new node, making the new node the last element in the list.

Algorithm:

• Go to the last node of the Linked List
• Change the next pointer of last node from NULL to the new node
• Make the next pointer of new node as NULL to show the end of Linked List

To read more about inserting at the end Refer, Insert Node at the End of a Linked List

kartik

Follow

Improve

Article Tags :

• Linked List
• DSA
• TCS
• Wipro

Practice Tags :

• TCS
• Wipro
• Linked List