# Print in Reverse

### Problem Statement :

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

Print the following:
3
2
1

Function Description:

Complete the reversePrint function in the editor below.

reversePrint has the following parameters:

Prints

The data values of each node in the reversed list.

Input Format:

The first line of input contains t, the number of test cases.

The input of each test case is as follows:
1. The first line contains an integer n, the number of elements in the list.
2. Each of the next n lines contains a data element for a list node.

Constraints:
1.   1<=n<=1000
2.   1<=list[i]<=1000

### Solution :

Solution in C :

In C:

//the following fuction is all that is needed to complete the
//challenge in hackerrank platform.

while(current!=NULL)
{   next=current->next;
current->next=prev;
prev=current;
current=next;

}
while(temp!=NULL)
{
printf("%d\n",temp->data);
temp=temp->next;
}

}

In C++:

//the following fuction is all that is needed to complete the
//challenge in hackerrank platform.

{
// This is a "method-only" submission.
// You only need to complete this method.
{
}

}

In Java:

//the following method is all that is needed to complete the
//challenge in hackerrank platform.

}

}

In Python 3 :

//the following method is all that is needed to complete the
//challenge in hackerrank platform.

return

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