1. You are given a singly linked list L0 -> L1 -> . . . -> Ln-1 -> Ln. 2. You have to write a function that rearranges the nodes in the list so that the new formed list is : L0 -> Ln -> L1 -> Ln-1 -> L2 -> Ln-2 and so on. 3. Note: your function should return the head of the rearranged linked list. 4. display is a utility function which displays the contents of Linked List, feel free to use it for debugging purposes. 5. main takes input from the users and creates the Linked List. You can use display to know its contents. 6. This is a functional problem. 7. You have to complete the rearrange function. It takes as input the head of the linked list. It should return the head of the rearranged linked list. 8. Don't change the code of Node, main and display.
Input Format
First line takes N, the number of elements in the list. Next line takes input N space separated numbers representing elements of the linked list. Input is handled for you.
Output Format
Rearranged Linked List. Output is handled for you.
Constraints
1 <= N <= 100
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
5 1 2 3 4 5
Output
1 5 2 4 3