Description

To add node in the end of the list - 
case 1: When list is empty
	create a node and assign the address of newly created node to the head
Case 2: When list has few elements
	step 1 : create a new node 
	step 2 : Traverse the list to reach last node
	step 3 : Assign the address of newly created node to address field of last node
	
Note: Here head contains the address of first node

C/C++

/* C program of Program To Add a node in the end of singly linked list */
//Save it as insert_node_end_singly_linked_list.c

#include<stdio.h>
#include<malloc.h>
struct node *create(int);
void display(struct node *);
struct node *insert_end(struct node *);


//Declaring node
struct node{
    int data;
    struct node *next;
};

int main(){
    int n;
    struct node *head;
    printf("Enter number of nodes : ");
    scanf("%d",&n);
    
    //Calling function to create node
    head=create(n);
    
    //Calling function to display list
    display(head);
    
    //Code to insert the node at end of linked list
    head=insert_end(head);
    printf("\nThe linked list after addition of node at end - \n");
    
    //Calling function to display list after addition of node at end
    display(head);

    return 0;
}

struct node *create(int n){
    int i;
    struct node *head=NULL;
    struct node *ptr,*newNode;

    for(i=0;i<n;i++){
        
        //Creating a new node
        newNode=(struct node*)malloc(sizeof(struct node*));
        
        //Assigning data to newly created node
        printf("Enter the value of %d node : ",i+1);
        scanf("%d",&newNode->data);
        newNode->next=NULL;
        
        /*If list is empty assign the address of newly created node to head*/
        if(head==NULL){
            head=newNode;
        }else{
            
            /* If list already have few elements then loop through
            list and add newly created node at the end of list*/
            ptr=head;
            while(ptr->next!=NULL){
                ptr=ptr->next;
            }
            ptr->next=newNode;
        }
    }
    return head;
}

void display(struct node *head){
    struct node *ptr;
    
    //If list is empty
    if(head==NULL){
        printf("The linked list is empty");
    }else{
        
        /*If list has elements then loop through the loop and
        print elements one by one in sequential manner*/
        ptr=head;
        while(ptr!=NULL){
            printf("The node value = %d and their address = %u\n",ptr->data,ptr);
            ptr=ptr->next;
        }
    }
}

//Function to insert a node in the end
struct node *insert_end(struct node *head){
    int data;
    struct node *ptr, *newNode;
    
    //Creating new node to be added
    newNode=(struct node*)malloc(sizeof(struct node*));

    printf("\nEnter the node data of new node to be added at the end: ");
    scanf("%d",&newNode->data);
    newNode->next=NULL;
    
    //assign the address of newly created node to the head if list is empty
    if(head==NULL){
        head=newNode;
    }else{
        ptr=head;
        while(ptr->next!=NULL){
            
            /*Traversing the list sequentially to reach the last node*/
            ptr=ptr->next;
        }
        
        //Assigning the address of newly created node to the address field of last node
        ptr->next=newNode;
    }
    return head;
}

Input:
Enter number of nodes : 3
Enter the value of 1 node : 4
Enter the value of 2 node : 2
Enter the value of 3 node : 7
The node value = 4 and their address = 6884688
The node value = 2 and their address = 6884720
The node value = 7 and their address = 6884736

Enter the node data of new node to be added at the end: 5

Output:
The linked list after addition of node at end -
The node value = 4 and their address = 6884688
The node value = 2 and their address = 6884720
The node value = 7 and their address = 6884736
The node value = 5 and their address = 6884752

Java

/* Java program of Program To Add a node in the end of singly linked list */
//Save it as AddNodeEndSinglyLinkedList.java

import java.io.*;
import java.util.Scanner;

public class AddNodeEndSinglyLinkedList {
    
    //Declaring node
    class Node{
        int data;
        Node next;
        public Node(int data) {
            this.data=data;
            
            //Assigning null value to the next field
            this.next=null;
        }
    }
    
    public Node head=null;
    
    //Function to add node
    public void addNode(int data) {
        
        //Creating a new node
        Node newNode = new Node(data);
        
        /*If list is empty assign the address of newly created node to head*/
        if(head==null) {
            head=newNode;
        }else {
            
            /* If list already have few elements then loop through 
            list and add newly created node at the end of list*/
            Node ptr=head;
            while(ptr.next!=null) {
                ptr=ptr.next;
            }
            ptr.next=newNode;
        }
    }
    
    public void display() {
        Node ptr=head;
        
        //If list is empty
        if(ptr==null) {
            System.out.println("The list is empty");
            return;
        }
        System.out.println("The nodes of lists are : ");
        
        /*If list has elements then loop through the loop and 
           print elements one by one in sequential manner*/
        while(ptr!=null) {
            System.out.print(ptr.data+" ");
            ptr=ptr.next;
        }
    }

    public static void main(String[] args) {
        
        Scanner scanner = new Scanner(System.in);
        
        AddNodeEndSinglyLinkedList list = new AddNodeEndSinglyLinkedList();
        
        System.out.println("Enter number of node you want to enter : ");
        int n=scanner.nextInt();
        
        for(int i=0;i<n;i++) {
            System.out.println("Enter value of "+(i+1)+" node : ");
            int val=scanner.nextInt();
            list.addNode(val);
        }
        
        //Calling function to display list
        list.display();
        
        System.out.println("\nEnter the value you want to enter at end : ");
        int end = scanner.nextInt();
        list.insert_end(end);
        
        //Calling function to display list after addition of node in the end
        System.out.println("After addition of node in the end - ");
        list.display();
    }
    
    //Function to insert node at the end
    private void insert_end(int end) {
        Node ptr=head;
        
        //Creating new node to be added
        Node newNode=new Node(end);
        
        //assign the address of newly created node to the head if list is empty
        if(ptr==null) {
            head=newNode;
        }else {
            while(ptr.next!=null) {
                
                /*Traversing the list sequentially to reach the last node*/
                ptr=ptr.next;
            }
            
            //Assigning the address of newly created node to the address field of last node
            ptr.next=newNode;
        }
    }
}

Input:
Enter number of node you want to enter : 
3
Enter value of 1 node : 
4
Enter value of 2 node : 
9
Enter value of 3 node : 
2
The nodes of lists are : 
4 9 2 
Enter the value you want to enter at end : 
7

Output:
After addition of node in the end - 
The nodes of lists are : 
4 9 2 7

Related Programs