1. What is the difference between Array List and Linked List ?
2. Inserting a node at the beginning of linked list
3. Insert a node after a given node in linked list
4. How to insert a node at the end of a given node? - Codzify.com Tutorials
5. Bubble Sort Algorithm with practical program in C
6. Insertion Sort Algorithm with practical program in C
7. Merge Sort Algorithm with practical program in C
8. BFS and DFS in Data Structure | Inorder, Preorder and Postorder Traversal with practical example.
9. Kruskals Algorithm with practical example
10. How to calculate the complexity of Algorithms?
11. How to insert a new node after a given node in a linked list? - Codzify.com Tutorials
12. How to insert a new node after a given node in a linked list? - Codzify.com

**Article by:** Manish Methani

**Last Updated:** October 11, 2021 at 10:04am IST

Linked List insertion can be done using three ways,

1) Insertion at front of given node.

2) Insertion after a given node.

3) Insertion at the end of node.

In this tutorial, we consider insertion at front of given node. To understand this look at the following figure,

1) The original Linked list contains a head pointer pointing to the First Node.

2) First Node points to the second Node.

3) The second Node points to NULL.

Now if we want to insert a node after a given node of the linked list, it should be like,

1) Head is pointing to the first Node containing value 1.

2) **New node** next is Pointing to second Node containing value 3.

3) The first node points to the new node containing value 2.

4) The second node points to the third node containing value 4.

5) The third node containing value 4 points to null.

Playing with the linked list is a very easy task. Just you should know which node will points to which node. This was the beginning of linked list insertion.

void insertAfter(struct node* prev_node, int dataValue) {/*1. check if the given prev_node is NULL */if (prev_node == NULL) { printf("the given previous node cannot be NULL"); return; }/* 2. allocate new node */struct node* new_node =(struct node*) malloc(sizeof(struct node));/* 2. put data into new node */new_node->data = dataValue;/* 4. Make next of new node as next of prev_node */new_node->next = prev_node->next;/* 5. move the next of prev_node as new_node */prev_node->next = new_node; }

Firebase & Angular.

Looking to learn how to create the production-ready apps

from scratch? Well, you are at the right place.

₹1299 or $15.56

## Learn to create the Dating App using No-Code Tool FlutterFlow

Level: **Advanced**

Mock Tests.

Test your C Programming skills with this comprehensive mock test on C Programming.

Take TestSolve most asked Interview Questions on Flutter and Test your foundational skills in flutter.

Take TestSolve most asked GATE Questions in Operating Systems and test your Gate Score.

Take TestThis is a mock test designed to help you assess your knowledge and skills in HTML and CSS.

Take TestSolve most asked GATE Questions in Data Structures and Algorithms and test your Gate Score.

Take TestMobile App