Given a singly linked list: A₀→A₁→…→A_n-1→A_n, reorder it to: A₀→A_n→A₁→A_n-1→A₂→A_n-2→…
For example: Given 1->2->3->4->5 its reorder is 1->5->2->4->3.

Note: It is recommended do this in-place without altering the nodes' values.

Example 1:

Input:
LinkedList: 1->2->3
Output: 1 3 2

Example 2:

Input:
LinkedList: 1->7->3->4
Output: 1 4 7 3.

Your Task:
The task is to complete the function reorderList() which should reorder the list as required. The reorder list is automatically printed by the driver's code.

Note: Try to solve without using any auxilliary space.

Expected Time Complexity: O(N)
Expected Auxiliary Space: O(1)

Constraints:
1 <= N <= 10⁴