# Program To Insert A New Node At The End Of The Singly Linked List

Program To Insert A New Node At The End Of The Singly Linked List on fibonacci, factorial, prime, armstrong, swap, reverse, search, sort, stack, queue, array, linkedlist, tree, graph etc.

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

### 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.

### Python

```#Represent a node of the singly linked list
class Node:
def __init__(self,data):
self.data = data;
self.next = None;

class InsertEnd:
def __init__(self):
self.tail = None;

#addAtEnd() will add a new node to the end of the list
#Create a new node
newNode = Node(data);

#Checks if the list is empty
#If list is empty, both head and tail will point to new node
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

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();

sList.display();

sList.display();

sList.display();

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;
};

struct node *head, *tail = NULL;

//addAtEnd() will add a new node to the end of the list
//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 list is empty, both head and tail will point to new node
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

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()
{
display();

display();

display();

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;
}
}

public Node tail = null;

//addAtEnd() will add a new node to the end of the list
//Create a new node
Node newNode = new Node(data);

//Checks if the list is empty
//If list is empty, both head and tail will point to new node
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
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();

sList.display();

sList.display();

sList.display();

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>{
public Node<T> tail = null;

//addAtEnd() will add a new node to the end of the list
//Create a new node
Node<T> newNode = new Node<T>(data);

//Checks if the list is empty
//If list is empty, both head and tail will point to new node
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

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>();

sList.display();

sList.display();

sList.display();

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{
public \$tail;
function __construct(){
\$this->tail = NULL;
}

//addAtEnd() will add a new node to the end of the list
//Create a new node
\$newNode = new Node(\$data);

//Checks if the list is empty
//If list is empty, both head and tail will point to new node
\$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

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();

\$sList->display();

\$sList->display();

\$sList->display();

\$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
```

Next Topic#