Reorder List

Problem Description:

Given a singly linked list: A0A1→→An-1An,reorder it to: A0AnA1An-1A2An-2

Given 1->2->3->4->5 its reorder is 1->5->2->4->3.

It is recommended do this in-place without altering the nodes’ values.


In this problem, methodtakes one argument: Address of the head of the linked list. The function should not read any input from stdin/console.
The node structure has a data part which stores the data and a next pointer which points to the next element of the linked list.
There are multiple test cases. For each test case, this method will be called individually.


Reorder it as explained above.


Leave a Reply

Your email address will not be published. Required fields are marked *