Q:

Program to insert a new node at the end of the singly linked list

belongs to collection: Singly Linked List Programs

robaa
Save to bookmark
|
2022-11-10
|
  178 
0

Explanation

In this program, we will create a singly linked list and add a new node at the end of the list. To accomplish this task, add a new node after the tail of the list such that tail's next will point to the newly added node. Then, make this new node as the new tail of the list.

Consider the above list; node 4 represents the tail of the original list. Let node New is the new node which needs to be added at the end of the list. Make 4's next to point to New. Make New as the new tail of the list.

Algorithm

  1. Create a class Node which has two attributes: data and next. Next is a pointer to the next node in the list.
  2. Create another class InsertEnd which has two attributes: head and tail.
  3. addAtEnd() will add a new node at the end of the list:
    1. Create a new node.
    2. It first checks, whether the head is equal to null which means the list is empty.
    3. If the list is empty, both head and tail will point to a newly added node.
    4. If the list is not empty, the new node will be added to end of the list such that tail's next will point to a newly added node. This new node will become the new tail of the list.
  4. display() will display the nodes present in the list:
    1. Define a node current which will initially point to the head of the list.
    2. Traverse through the list till current points to null.
    3. Display each node by making current to point to node next to it in each iteration.

Input:

 

#Adding 1 to the list  

sList.addAtEnd(1);  

#Adding 2 to the list  

sList.addAtEnd(2);  

#Adding 3 to the list  

sList.addAtEnd(3);  

#Adding 4 to the list  

sList.addAtEnd(4);  

Output:

Adding nodes to the end of the list: 1
Adding nodes to the end of the list: 1 2
Adding nodes to the end of the list: 1 2 3
Adding nodes to the end of the list: 1 2 3 4
Python programming, Php programming, Java programming, C programming, c# programming, examples, Python programming examples, Php programming examples, Java programming examples, C programming examples, c# programming examples,
login and add your own answer to this question

All Answers

robaa
2022-11-10
need an explanation for this answer? contact us directly to get an explanation for this answer

Python

#Represent a node of the singly linked list  
class Node:  
    def __init__(self,data):  
        self.data = data;  
        self.next = None;  
          
class InsertEnd:  
    #Represent the head and tail of the singly linked list  
    def __init__(self):  
        self.head = None;  
        self.tail = None;  
          
    #addAtEnd() will add a new node to the end of the list  
    def addAtEnd(self, data):  
        #Create a new node  
        newNode = Node(data);  
          
        #Checks if the list is empty  
        if(self.head == None):  
            #If list is empty, both head and tail will point to new node  
            self.head = newNode;  
            self.tail = newNode;  
        else:  
            #newNode will be added after tail such that tail's next will point to newNode  
            self.tail.next = newNode;  
            #newNode will become new tail of the list  
            self.tail = newNode;  
              
    #display() will display all the nodes present in the list  
    def display(self):  
        #Node current will point to head  
        current = self.head;  
          
        if(self.head == None):  
            print("List is empty");  
            return;  
              
        print("Adding nodes to the end of the list: ");  
        while(current != None):  
            #Prints each node by incrementing pointer  
            print(current.data)  
            current = current.next;  
   
sList = InsertEnd();  
          
#Adding 1 to the list  
sList.addAtEnd(1);  
sList.display();  
   
#Adding 2 to the list  
sList.addAtEnd(2);  
sList.display();  
   
#Adding 3 to the list  
sList.addAtEnd(3);  
sList.display();  
   
#Adding 4 to the list  
sList.addAtEnd(4);  
sList.display();

 

Output:

 Adding nodes to the end of the list: 
1 
Adding nodes to the end of the list: 
1 2 
Adding nodes to the end of the list: 
1 2 3 
Adding nodes to the end of the list: 
1 2 3 4

 

C

#include <stdio.h>  
   
//Represent a node of the singly linked list  
struct node{  
    int data;  
    struct node *next;  
};      
   
//Represent the head and tail of the singly linked list  
struct node *head, *tail = NULL;  
   
//addAtEnd() will add a new node to the end of the list  
void addAtEnd(int data) {  
    //Create a new node  
    struct node *newNode = (struct node*)malloc(sizeof(struct node));  
    newNode->data = data;  
    newNode->next = NULL;  
      
    //Checks if the list is empty  
    if(head == NULL) {  
        //If list is empty, both head and tail will point to new node  
        head = newNode;  
        tail = newNode;  
    }  
    else {  
        //newNode will be added after tail such that tail's next will point to newNode  
        tail->next = newNode;  
        //newNode will become new tail of the list  
        tail = newNode;  
    }  
}  
      
//display() will display all the nodes present in the list  
void display() {  
    //Node current will point to head  
    struct node *current = head;  
      
    if(head == NULL) {  
        printf("List is empty\n");  
        return;  
    }  
    printf("Adding nodes to the end of the list: \n");  
    while(current != NULL) {  
        //Prints each node by incrementing pointer  
        printf("%d ", current->data);  
        current = current->next;  
    }  
    printf("\n");  
}  
      
int main()  
{  
    //Adding 1 to the list  
    addAtEnd(1);  
    display();  
      
    //Adding 2 to the list  
    addAtEnd(2);  
    display();  
      
    //Adding 3 to the list  
    addAtEnd(3);  
    display();  
      
    //Adding 4 to the list  
    addAtEnd(4);  
    display();  
   
    return 0;  
}

 

Output:

Adding nodes to the end of the list: 
1 
Adding nodes to the end of the list: 
1 2 
Adding nodes to the end of the list: 
1 2 3 
Adding nodes to the end of the list: 
1 2 3 4

 

JAVA

public class InsertEnd {  
      
    //Represent a node of the singly linked list  
    class Node{  
        int data;  
        Node next;  
          
        public Node(int data) {  
            this.data = data;  
            this.next = null;  
        }  
    }  
   
    //Represent the head and tail of the singly linked list  
    public Node head = null;  
    public Node tail = null;  
      
    //addAtEnd() will add a new node to the end of the list  
    public void addAtEnd(int data) {  
        //Create a new node  
        Node newNode = new Node(data);  
          
        //Checks if the list is empty  
        if(head == null) {  
            //If list is empty, both head and tail will point to new node  
            head = newNode;  
            tail = newNode;  
        }  
        else {  
            //newNode will be added after tail such that tail's next will point to newNode  
            tail.next = newNode;  
            //newNode will become new tail of the list  
            tail = newNode;  
        }  
    }  
      
    //display() will display all the nodes present in the list  
    public void display() {  
        //Node current will point to head  
        Node current = head;  
        if(head == null) {  
            System.out.println("List is empty");  
            return;  
        }  
        System.out.println("Adding nodes to the end of the list: ");  
        while(current != null) {  
            //Prints each node by incrementing pointer  
            System.out.print(current.data + " ");  
            current = current.next;  
        }  
        System.out.println();  
    }  
      
    public static void main(String[] args) {  
          
        InsertEnd sList = new InsertEnd();  
          
        //Adding 1 to the list  
        sList.addAtEnd(1);  
        sList.display();  
          
        //Adding 2 to the list  
        sList.addAtEnd(2);  
        sList.display();  
          
        //Adding 3 to the list  
        sList.addAtEnd(3);  
        sList.display();  
          
        //Adding 4 to the list  
        sList.addAtEnd(4);  
        sList.display();  
    }  
}

 

 

Output:

Adding nodes to the end of the list: 
1 
Adding nodes to the end of the list: 
1 2 
Adding nodes to the end of the list: 
1 2 3 
Adding nodes to the end of the list: 
1 2 3 4

 

C#

using System;  
                      
public class CreateList  
{  
    //Represent a node of the singly linked list  
    public class Node<T>{  
        public T data;  
        public Node<T> next;  
          
        public Node(T value) {  
            data = value;  
            next = null;  
        }  
    }  
          
    public class InsertEnd<T>{  
        //Represent the head and tail of the singly linked list  
        public Node<T> head = null;               
         public Node<T> tail = null;  
      
        //addAtEnd() will add a new node to the end of the list  
        public void addAtEnd(T data) {  
            //Create a new node  
            Node<T> newNode = new Node<T>(data);  
   
            //Checks if the list is empty  
            if(head == null) {  
                //If list is empty, both head and tail will point to new node  
                head = newNode;  
                tail = newNode;  
            }  
            else {  
                //newNode will be added after tail such that tail's next will point to newNode  
                tail.next = newNode;  
                //newNode will become new tail of the list  
                tail = newNode;  
            }  
        }  
   
        //display() will display all the nodes present in the list  
        public void display() {  
            //Node current will point to head  
            Node<T> current = head;  
              
            if(head == null) {  
                Console.WriteLine("List is empty");  
                return;  
            }  
            Console.WriteLine("Adding nodes to the end of the list: ");  
            while(current != null) {  
                //Prints each node by incrementing pointer  
                Console.Write(current.data + " ");  
                current = current.next;  
            }  
            Console.WriteLine();  
        }  
    }  
      
    public static void Main()  
    {  
        InsertEnd<int> sList = new InsertEnd<int>();  
          
        //Adding 1 to the list  
        sList.addAtEnd(1);  
        sList.display();  
          
        //Adding 2 to the list  
        sList.addAtEnd(2);  
        sList.display();  
          
        //Adding 3 to the list  
        sList.addAtEnd(3);  
        sList.display();  
          
        //Adding 4 to the list  
        sList.addAtEnd(4);  
        sList.display();  
    }  
}

 

Output:

Adding nodes to the end of the list: 
1 
Adding nodes to the end of the list: 
1 2 
Adding nodes to the end of the list: 
1 2 3 
Adding nodes to the end of the list: 
1 2 3 4

 

PHP

<!DOCTYPE html>  
<html>  
<body>  
<?php  
//Represent a node of singly linked list  
class Node{  
    public $data;  
    public $next;  
      
    function __construct($data){  
        $this->data = $data;  
        $this->next = NULL;  
    }  
}  
class InsertEnd{  
    //Represent the head and tail of the singly linked list  
    public $head;  
    public $tail;  
    function __construct(){  
        $this->head = NULL;  
        $this->tail = NULL;  
    }  
      
    //addAtEnd() will add a new node to the end of the list  
    function addAtEnd($data) {  
        //Create a new node  
        $newNode = new Node($data);  
          
        //Checks if the list is empty  
        if($this->head == null) {  
            //If list is empty, both head and tail will point to new node  
            $this->head = $newNode;  
            $this->tail = $newNode;  
        }  
        else {  
            //newNode will be added after tail such that tail's next will point to newNode  
            $this->tail->next = $newNode;  
            //newNode will become new tail of the list  
            $this->tail = $newNode;  
        }  
    }  
      
    //display() will display all the nodes present in the list  
    function display() {  
        //Node current will point to head  
        $current = $this->head;  
          
        if($this->head == NULL) {  
            print("List is empty <br>");  
            return;  
        }  
        print("Adding nodes to the end of the list: <br>");  
        while($current != NULL) {  
            //Prints each node by incrementing pointer  
            print($current->data . " ");  
            $current = $current->next;  
        }  
        print("<br>");  
    }  
}  
   
$sList = new InsertEnd();  
          
//Adding 1 to the list  
$sList->addAtEnd(1);  
$sList->display();  
   
//Adding 2 to the list  
$sList->addAtEnd(2);  
$sList->display();  
   
//Adding 3 to the list  
$sList->addAtEnd(3);  
$sList->display();  
   
//Adding 4 to the list  
$sList->addAtEnd(4);  
$sList->display();  
?>  
</body>  
</html>

 

Output:

Adding nodes to the end of the list: 
1 
Adding nodes to the end of the list: 
1 2 
Adding nodes to the end of the list: 
1 2 3 
Adding nodes to the end of the list: 
1 2 3 4

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

Singly Linked List Programs
This question belongs to these collections

Similar questions

need a help?

find thousands of online teachers now
Program to remove duplicate elements from a singly... >>
<< Program to insert a new node at the beginning of t...