# Insert Node at the End of Singly Linked List

“** Insert Node at the End of Singly Linked List**” is very basic problem of linked list for beginners. Here, a new node is added at the end of the linked list.

**Example:**

Current Linked List: 1 -> 2 -> 3 -> 4 -> NULL After Inserting Node with Value ‘5’, the linked list become: 1 -> 2 -> 3 -> 4 -> 5 -> NULL

The steps required to insert the new node at the beginning of the linked list is as follows:

- Create a new node with the desired value in data part and NULL value in pointer part.
- Check whether linked list is empty or not.
- If linked list is empty, then the new node will become the head of the linked list.
- Else if linked is not empty, then traverse the whole linked list and reach to the last node of the linked list, then point the pointer part of last node of the linked list to the new node.

If the current linked list is {1->2->3}, then after inserting node with value 4, the newly linked list will become {1->2->3->4}.

**C++ Program insert new node at the end of the linked list is as follows:**

/* C++ Program to Insert New Node at the End of the Linked List */ #include<bits/stdc++.h> using namespace std; /* Structrue of the Node */ struct node { int data; struct node *next; }; /* Function to create New Node of the Linked List */ struct node *create(struct node **new_node, int ele) { (*new_node) = (struct node*)malloc(sizeof(struct node)); (*new_node)->data = ele; (*new_node)->next = NULL; return (*new_node); } /* Function to Insert New Node at the End of the Linked List */ void insert_end(struct node **head, int ele) { /*Creating a new node.*/ struct node *new_node; new_node = (struct node*)malloc(sizeof(struct node)); new_node->data = ele; new_node->next = NULL; /* check whether the linked list is empty or not*/ /* If empty, new node will become head of the linked list */ if(*head == NULL) { *head = new_node; return; } /*If not empty, we traverse the complete linked list and points the last node of the linked list to the new node */ struct node *temp = NULL; temp = (*head); while(temp->next != NULL) temp=temp->next; temp->next = new_node; } /* Function to Print the Linked List */ void print(struct node *head) { struct node *p = head; while(p!=NULL) { cout<<p->data<<" "; p=p->next; } } int main() { struct node *head; head = NULL; cout<<"Inserting 3 Nodes to the End of the Linked List!!"; insert_end(&head,1); insert_end(&head,2); insert_end(&head,3); cout<<"\nThe Nodes of the Linked List are: \n"; print(head); }

Inserting 3 Nodes to the End of the Linked List!! The Nodes of the Linked List are: 1 2 3OUTPUT:

**Related Posts:**

**Insert a New Node at the beginning of the Linked List.****Insert a New Node at the Middle of the Linked List.****Insert a New Node at the Sorted Linked List.****Reverse a Linked List.****Reverse a Linked List Using Stack.****Printing Linked List in Reverse Order without actually reversing the Linked List.****Swap Adjacent Elements of the Linked List.****Count All Occurrences of a Particular Node in a Linked List.****Bubble Sort on Linked List.****Detect a Loop in a Linked List.****Find the Length of the Loop present in the Linked List.****Detect and Remove Loop from a Linked List.****Segregate Even and Odd Nodes of the Linked List.****Delete Complete Linked List.****Delete Nth Node of the Linked List.****Delete without head pointer of the Linked List.****Delete All Occurrences of particular node of the Linked List.****Delete Alternate Nodes of the Linked List.****Delete every ‘N’ Nodes After ‘M’ Nodes of the Linked List.****Remove Duplicate Nodes from an Unsorted Linked List**