Given Pointer/Reference to the head of the linked list, the task is to Sort the given linked list using Merge Sort.
Note: If the length of linked list is odd, then the extra node should go in the first list while splitting.
Input:
First line of input contains number of testcases T. For each testcase, first line of input contains number of nodes in the linked list and next line contains N elements of the linked list.
Output:
For each test, in a new line, print the sorted linked list.
Your Task:
For C++ and Python: The task is to complete the function mergeSort() which sort the linked list using merge sort function.
For Java: The task is to complete the function mergeSort() and return the node which can be used to print the sorted linked list.
Constraints:
1 <= T <= 100
1 <= N <= 105
Note: Try to solve the problem in constant space.
Example:
Input:
2
5
3 5 2 4 1
3
9 15 0
Output:
1 2 3 4 5
0 9 15
Explanation:
Testcase 1: After sorting the given linked list, the resultant matrix will be 1->2->3->4->5.
Testcase 2: After sorting the given linked list , resultant will be 0->9->15.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
| praneethmamidala83 | 583 |
| pallavimanukonda8 | 563 |
| a8haysingh | 451 |
| vraamg | 432 |
| RajatGarg5 | 386 |
| descifrador | 1683 |
| mantu_singh | 1520 |
| rishabh2017 | 1273 |
| gladiator121 | 1268 |
| kid_kb | 1264 |
| blackshadows | 5362 |
| Ibrahim Nash | 5244 |
| akhayrutdinov | 5111 |
| mb1973 | 4974 |
| Quandray | 4732 |