Reorder List

Problem Description:

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→

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.

Input:

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.

Output:

Reorder it as explained above.

/* Following is the Linked list node structure */
/*struct node
{
    int data;
    struct node* next;
};*/

void reorderList(struct node* head)
{
    // Your code here
    node *nodes[210];
    int idx=0,last;
    node *tmp=head,*t;
    while(tmp)
    {
        idx+=1;
        nodes[idx]=tmp;
        tmp=tmp->next;
    }
    last=idx;
    for(int i=1;i<=idx/2;i++)
    {
        nodes[last-i]->next=NULL;
        tmp=nodes[last-i+1];
        t=nodes[i]->next;
        nodes[i]->next=tmp;
        tmp->next=t;
    }
}