# Javascript Program For Rearranging A Linked List In Zig-Zag Fashion

Last Updated : 09 Dec, 2022

Given a linked list, rearrange it such that the converted list should be of the form a < b > c < d > e < f â€¦ where a, b, câ€¦ are consecutive data nodes of the linked list.

Examples:

```Input:  1->2->3->4
Output: 1->3->2->4
Explanation: 1 and 3 should come first before 2 and 4 in
will be 1->3->2->4.

Input:  11->15->20->5->10
Output: 11->20->5->15->10 ```

## We strongly recommend that you click here and practice it, before moving on to the solution.

A simple approach to do this is to sort the linked list using merge sort and then swap alternate, but that requires O(n Log n) time complexity. Here n is a number of elements in the linked list.

An efficient approach that requires O(n) time is, using a single scan similar to bubble sort and then maintain a flag for representing which order () currently we are. If the current two elements are not in that order then swap those elements otherwise not. Please refer to this for a detailed explanation of the swapping order.

## Javascript

 ` `

Output:

```Given linked list
4->3->7->8->6->2->1->NULL
3->7->4->8->2->6->1->NULL```

Time Complexity: O(N), as we are using a loop for traversing the linked list.

Auxiliary Space: O(1), as we are not using extra space.

Another Approach:
In the above code, the push function pushes the node at the front of the linked list, the code can be easily modified for pushing the node at the end of the list. Another thing to note is, swapping of data between two nodes is done by swap by value not swap by links for simplicity, for the swap by links technique please see this.

This can be also be done recursively. The idea remains the same, let us suppose the value of the flag determines the condition we need to check for comparing the current element. So, if the flag is 0 (or false) the current element should be smaller than the next and if the flag is 1 ( or true ) then the current element should be greater than the next. If not, swap the values of nodes.

## Javascript

 ` `

Output:

```11 ->15 ->20 ->5 ->10 ->
LL in zig zag fashion :
11 ->20 ->5 ->15 ->10 ->```

Complexity Analysis:

• Time Complexity: O(n).
Traversal of the list is done only once, and it has ‘n’ elements.
• Auxiliary Space: O(n).
O(n) extra space  due to recursive calls

Please refer complete article on Rearrange a Linked List in Zig-Zag fashion for more details!

Previous
Next