Problem of the day
If the given linked list is 1 -> 2 -> 3 -> 4 -> 5 -> NULL.
Then rearrange it into 1 -> 5 -> 2 -> 4 -> 3 -> NULL.
The first line of input contains an integer 'T' representing the number of test cases. Then the test case follows.
The only line of each test case contains the elements of the singly linked list separated by a single space and terminated by -1. Hence, -1 would never be a list element.
For each test case, Print a single line containing the linked list in the specified form. The elements of the linked list must be separated by a single space and terminated by -1.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= 'T' <= 10
0 <= 'L' <= 1000
1 <= data <= 10 ^ 9 and data != -1
Where ‘T’ is the number of test-cases and ‘L’ is the number of nodes in the Linked List, and ‘data’ is the data in each node of the list.
Time Limit: 1 sec.
2
1 2 3 4 5 6 -1
1 2 -1
1 6 2 5 3 4 -1
1 2 -1
For the first test case, we have 1 as the starting element followed by 6, 2, 5, 3 and 4 respectively in the linked list after rearrangement.
For the second test case, we will get the same linked list after rearrangement, Therefore 1 2.
2
2 4 6 8 10 -1
-1
2 10 4 8 6 -1
-1