{"id":26671,"date":"2017-12-22T20:02:11","date_gmt":"2017-12-22T14:32:11","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26671"},"modified":"2017-12-22T20:02:11","modified_gmt":"2017-12-22T14:32:11","slug":"c-programming-inserting-node-linked-list","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/c-programming-inserting-node-linked-list\/","title":{"rendered":"C Programming – Inserting a node in Linked List | Set 2"},"content":{"rendered":"

We have introduced Linked Lists in the previous post. We also created a simple linked list with 3 nodes and discussed linked list traversal.<\/span><\/p>\n

All programs discussed in this post consider following representations of linked list<\/p>\n

C Programming:<\/strong><\/p>\n

<\/div> 
\/\/ A linked list nodestruct node{  int data;  struct node *next;};<\/code><\/pre> <\/div>\n
In this post, methods to insert a new node in linked list are discussed. A node can be added in three ways
\n1)<\/strong> At the front of the linked list
\n2) <\/strong>After a given node.
\n3)<\/strong> At the end of the linked list.<\/p>\n[ad type=”banner”]\n
Add a node at the front: (A 4 steps process)<\/strong>
\nThe new node is always added before the head of the given Linked List. And newly added node becomes the new head of the Linked List. For example if the given Linked List is 10->15->20->25 and we add an item 5 at the front, then the Linked List becomes 5->10->15->20->25. Let us call the function that adds at the front of the list is push(). The push() must receive a pointer to the head pointer, because push must change the head pointer to point to the new node (See this)<\/p>\n
\"C<\/p>\n
Following are the 4 steps to add node at the front.<\/p>\n
C Programming:<\/strong><\/p>\n
 
 <\/div> 
\/* Given a reference (pointer to pointer) to the head of a list   and an int,  inserts a new node on the front of the list. *\/void push(struct node** head_ref, int new_data){    \/* 1. allocate node *\/    struct node* new_node = (struct node*) malloc(sizeof(struct node));      \/* 2. put in the data  *\/    new_node->data  = new_data;      \/* 3. Make next of new node as head *\/    new_node->next = (*head_ref);      \/* 4. move the head to point to the new node *\/    (*head_ref)    = new_node;}<\/code><\/pre> <\/div>\n
Time complexity of push() is O(1) as it does constant amount of work.<\/p>\n[ad type=”banner”]\n
Add a node after a given node: (5 steps process)<\/strong>
\nWe are given pointer to a node, and the new node is inserted after the given node.<\/p>\n
\"C
\nC Programming:<\/strong><\/p>\n
 
 <\/div> 
\/* Given a node prev_node, insert a new node after the given   prev_node *\/void insertAfter(struct node* prev_node, int new_data){    \/*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));      \/* 3. put in the data  *\/    new_node->data  = new_data;      \/* 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;}<\/code><\/pre> <\/div>\n
Time complexity of insertAfter() is O(1) as it does constant amount of work.<\/p>\n[ad type=”banner”]\n
Add a node at the end: (6 steps process)<\/strong>
\nThe new node is always added after the last node of the given Linked List. For example if the given Linked List is 5->10->15->20->25 and we add an item 30 at the end, then the Linked List becomes 5->10->15->20->25->30.
\nSince a Linked List is typically represented by the head of it, we have to traverse the list till end and then change the next of last node to new node.<\/p>\n
\"C<\/p>\n
Following are the 6 steps to add node at the end<\/p>\n
C Programming:<\/strong><\/p>\n
 
 <\/div> 
\/* Given a reference (pointer to pointer) to the head   of a list and an int, appends a new node at the end  *\/void append(struct node** head_ref, int new_data){    \/* 1. allocate node *\/    struct node* new_node = (struct node*) malloc(sizeof(struct node));     struct node *last = *head_ref;  \/* used in step 5*\/      \/* 2. put in the data  *\/    new_node->data  = new_data;     \/* 3. This new node is going to be the last node, so make next           of it as NULL*\/    new_node->next = NULL;     \/* 4. If the Linked List is empty, then make the new node as head *\/    if (*head_ref == NULL)    {       *head_ref = new_node;       return;    }            \/* 5. Else traverse till the last node *\/    while (last->next != NULL)        last = last->next;      \/* 6. Change the next of last node *\/    last->next = new_node;    return;    }<\/code><\/pre> <\/div>\n
Time complexity of append is O(n) where n is the number of nodes in linked list. Since there is a loop from head to end, the function does O(n) work.
\nThis method can also be optimized to work in O(1) by keeping an extra pointer to tail of linked list<\/p>\n[ad type=”banner”]\n
Following is a complete program that uses all of the above methods to create a linked list.<\/strong><\/p>\n
C Programming:<\/strong><\/p>\n
 
 <\/div> 
\/\/ A complete working C program to demonstrate all insertion methods\/\/ on Linked List#include <stdio.h>#include <stdlib.h> \/\/ A linked list nodestruct node{  int data;  struct node *next;}; \/* Given a reference (pointer to pointer) to the head of a list and    an int, inserts a new node on the front of the list. *\/void push(struct node** head_ref, int new_data){    \/* 1. allocate node *\/    struct node* new_node = (struct node*) malloc(sizeof(struct node));     \/* 2. put in the data  *\/    new_node->data  = new_data;     \/* 3. Make next of new node as head *\/    new_node->next = (*head_ref);     \/* 4. move the head to point to the new node *\/    (*head_ref)    = new_node;} \/* Given a node prev_node, insert a new node after the given    prev_node *\/void insertAfter(struct node* prev_node, int new_data){    \/*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));     \/* 3. put in the data  *\/    new_node->data  = new_data;     \/* 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;} \/* Given a reference (pointer to pointer) to the head   of a list and an int, appends a new node at the end  *\/void append(struct node** head_ref, int new_data){    \/* 1. allocate node *\/    struct node* new_node = (struct node*) malloc(sizeof(struct node));     struct node *last = *head_ref;  \/* used in step 5*\/     \/* 2. put in the data  *\/    new_node->data  = new_data;     \/* 3. This new node is going to be the last node, so make next of          it as NULL*\/    new_node->next = NULL;     \/* 4. If the Linked List is empty, then make the new node as head *\/    if (*head_ref == NULL)    {       *head_ref = new_node;       return;    }     \/* 5. Else traverse till the last node *\/    while (last->next != NULL)        last = last->next;     \/* 6. Change the next of last node *\/    last->next = new_node;    return;} \/\/ This function prints contents of linked list starting from headvoid printList(struct node *node){  while (node != NULL)  {     printf(" %d ", node->data);     node = node->next;  }} \/* Driver program to test above functions*\/int main(){  \/* Start with the empty list *\/  struct node* head = NULL;   \/\/ Insert 6.  So linked list becomes 6->NULL  append(&head, 6);   \/\/ Insert 7 at the beginning. So linked list becomes 7->6->NULL  push(&head, 7);   \/\/ Insert 1 at the beginning. So linked list becomes 1->7->6->NULL  push(&head, 1);   \/\/ Insert 4 at the end. So linked list becomes 1->7->6->4->NULL  append(&head, 4);   \/\/ Insert 8, after 7. So linked list becomes 1->7->8->6->4->NULL  insertAfter(head->next, 8);   printf("\\n Created Linked list is: ");  printList(head);   return 0;}<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
 Created Linked list is:  1  7  8  6  4<\/pre>\n","protected":false},"excerpt":{"rendered":"
C Programming -Time complexity of append is O(n) where n is number of nodes in linked list. Since there is a loop from head to end, the function does O(n) <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69866,1,79476,79478],"tags":[79729,2870,79728,79721,79723,79720,79724,2874,79719,79726,79727,79725,79722,2869,79730],"class_list":["post-26671","post","type-post","status-publish","format-standard","hentry","category-c-programming","category-coding","category-linked-list","category-singly-linked-list","tag-advantages-and-disadvantages-of-linked-list-over-array","tag-arraylist-vs-linkedlist-c","tag-difference-between-array-and-linked-list-in-data-structure","tag-difference-between-array-and-linked-list-in-java","tag-difference-between-array-and-linked-list-ppt","tag-difference-between-array-and-linked-list-wikipedia","tag-difference-between-array-and-stack","tag-difference-between-arraylist-and-array","tag-difference-between-arraylist-and-linked-list","tag-difference-between-arraylist-and-linkedlist-and-vector-in-java","tag-difference-between-arraylist-and-vector","tag-difference-between-singly-linked-list-and-doubly-linked-list","tag-linked-list-vs-array-performance","tag-what-is-doubly-linked-list-in-java","tag-what-is-the-difference-between-hashset-and-hashmap-classes-in-collection-framework"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26671","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26671"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26671\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26671"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26671"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26671"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}