Reverse a Singly Linked List

Given a singly linked list of integers, your task is to return the head of the reversed linked list.

Explanation:

Reverse a given singly linked list so that the last element becomes the first and the first becomes the last.

Input:

The first line of input contains an integer 'T' representing the number of test cases or queries to be processed. Each test case consists of the elements of the singly linked list separated by a single space and terminated by -1. Note that -1 is not a part of the list.

Output:

For each test case, print the given linked list in reverse order in a separate line.

Example:

Input:
3
1 2 3 4 -1
5 6 7 -1
8 9 -1

Output:
4 3 2 1
7 6 5
9 8

Constraints:

• 1 <= T <= 5
• 0 <= L <= 10^5
• 1 <= data <= 10^9 and data ≠ -1

Note:

You do not need to print anything, as it is already managed for you. Simply implement the provided function.