Insertion Sort in a Linked List

Given a singly linked list with 'N' nodes containing integer values, your task is to sort the list using insertion sort and output the sorted list.

Insertion Sort is an algorithm where elements are removed one at a time from the input data, positioned in their correct location within a growing sorted list, and this process continues until no unsorted elements remain.

Input:

The first line contains an integer T, representing the number of test cases.
The subsequent lines for each test case contain space-separated integers representing the elements of the linked list, ending with -1.
Note that -1 is used to mark the end of the list and is not a list element.

Output:

For each test case, print the sorted linked list elements as space-separated integers.
Output each sorted list on a new line for every test case.

Example:

Input:

2
4 3 2 10 -1
1 7 5 2 -1

Output:

2 3 4 10
1 2 5 7

Constraints:

• 1 <= T <= 50
• 1 <= N <= 10³
• 0 <= value of node < 10⁹

Note:

You are not required to print the results yourself; handle only the function implementation. Aim to sort the linked list in-place.