Unfold Of Linkedlist

easy
Question Solve Solutions 
Given a singly linkedlist : l0 -> ln -> l1 -> ln-1 -> l2 -> ln-2 -> l3 -> ln-3 -> ..... 
reorder it :  l0 -> l1 -> l2 -> l3 -> l4 -> l5 -> l6 ..... -> ln-1 -> ln
for more information watch video.

Input Format

1->7->2->6->3->5->4->null

Output Format

1->2->3->4->5->6->7->null

Constraints

0 <= N <= 10^6

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
9 5 1 1 4 4 6 6 9 9
Output
5 1 4 6 9 9 6 4 1
Previous
Fold Of Linkedlist
Next
Merge Two Sorted Linkedlist

Related Questions

easy Reverse A Linkedlist easy Middle Of A Linked List easy Palindrome Linkedlist easy Fold Of Linkedlist easy Merge Two Sorted Linkedlist easy Mergesort Linkedlist easy Segregate Even And Odd Nodes In A Linkedlist easy Remove Nth Node From End Of Linkedlist easy Merge K Sorted Linkedlist easy Reverse Node Of Linkedlist In K Group easy Reverse In Range easy Copy Linkedlist With Random Pointers easy Is Cycle Present In Linkedlist easy Add Two Linkedlist medium Subtract Two Linkedlist easy Multiply Two Linkedlist