Linked List that is Sorted Alternatingly
Submissions: 4873   Accuracy:

37.36%

  Difficulty: Easy   Marks: 2

Given a Linked list of size N, the list is in alternating ascending and descending orders. Your task is to complete the function sort() that sorts the given linked list in non-decreasing order.

Input:
The function takes a single argument as input the reference pointer to the head of the linked list.
There are T test cases and for each test case the function will be called separately.

Output:
For each test case function should return reference pointer to the head of the new linked list.

User Task:
The task is to complete the function sort() which should sort the linked list in non-decreasing order.

Constraints:
1 <= T <= 100
1 <= N <= 100
0 <= A[] <= 103

Example:
Input:

2
6
1 9 2 8 3 7
5
13 99 21 80 50

Output:
1 2 3 7 8 9
13 21 50 80 99

Explanation:
Testcase 1:
After sorting the given linked list, the list will be as 1-> 2-> 3-> 7-> 8-> 9.

 

** For More Input/Output Examples Use 'Expected Output' option **

Author: harshitsidhwa


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.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.