# Insert a Node at the Tail of a Linked List HackerRank Solution.

You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty.

Input Format

You have to complete theÂ `SinglyLinkedListNode insertAtTail(SinglyLinkedListNode head, int data)`Â method. It takes two arguments: the head of the linked list and the integer to insert at tail. You shouldÂ notÂ read any input from the stdin/console.

The input is handled by code editor and is as follows:
The first line contains an integerÂ n, denoting the elements of the linked list.
The nextÂ nÂ lines contain an integer each, denoting the element that needs to be inserted at tail.

Constraints

• 1 <= n <= 1000
• 1 <= list’i <= 1000

Output Format

Insert the new node at the tail and justÂ `return`Â the head of the updated linked list. DoÂ notÂ print anything to stdout/console.

The output is handled by code in the editor and is as follows:
Print the elements of the linked list from head to tail, each in a new line.

Sample Input

```5
141
302
164
530
474

```

Sample Output

```141
302
164
530
474

```

Explanation

First the linked list is NULL. After inserting 141, the list is 141 -> NULL.
After inserting 302, the list is 141 -> 302 -> NULL.
After inserting 164, the list is 141 -> 302 -> 164 -> NULL.
After inserting 530, the list is 141 -> 302 -> 164 -> 530 -> NULL. After inserting 474, the list is 141 -> 302 -> 164 -> 530 -> 474 -> NULL, which is the final list.

Code:

```static SinglyLinkedListNode insertNodeAtTail(SinglyLinkedListNode head, int data) {

return insertNode;
}

while(temp.next != null) {
temp = temp.next;
}
temp.next  = insertNode;
insertNode.next = null;

}
```

Time complexity of insertat tail 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.
This method can also be optimized to work in O(1) by keeping an extra pointer to tail of linked list.

Hope you guys understand the simple solution of inserting a node at tail in linked list in java.

In next blog we will see other operations on linked list till then Bye Bye..!

Happy Coding..!

Thank Youâ€¦!

Categories: HackerRank Questions, JAVA