# Insert a Node at the Tail of a Linked List

### Problem Statement :

```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. 1<=n<=1000
2. 1<=list[i]<=1000```

### Solution :

```                            ```Solution in C :

In C:

// The following part of code is all you need to complete the challenge in
//hackerrank. Rest is already coded there.

t->data = data;
t->next = NULL;
}
while(tem->next != NULL){
tem = tem->next;
}
tem->next = t;

}

In C++:

// The following function is all you need to complete the challenge in
//hackerrank platform

{
Node * newN=new Node;
newN->next=NULL;
newN->data=data;
if(temp==NULL)
return newN;
while(temp->next!=NULL)
temp=temp->next;
temp->next=newN;
}

In Java:

//The following method is all you need to complete the challenge in
//hackerrank platform

return newNode;
}
while(cur.next != null){
cur = cur.next;
}
cur.next = newNode;
}

In Python 3:

# The following method is all that id needed to complete the
# challenge in hackerrank.

return Node(data)
while pnt.next:
pnt = pnt.next
pnt.next = Node(data)
```

## Insert a node at a specific position in a linked list

Given the pointer to the head node of a linked list and an integer to insert at a certain position, create a new node with the given integer as its data attribute, insert this node at the desired position and return the head node. A position of 0 indicates head, a position of 1 indicates one node away from the head and so on. The head pointer given may be null meaning that the initial list is e

## Delete a Node

Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example: list=0->1->2->3 position=2 After removing the node at position 2, list'= 0->1->-3. Function Description: Complete the deleteNode function in the editor below. deleteNo

## Print in Reverse

Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing