node *reverse(node *first)
{
   node *temp = NULL;

   if(first->next != NULL)
   {
        temp = reverse(first->next);
        temp->next = first;
        return first;
   }
   else
        return first;
}
//The only catch is that the supposed to be first node after
reordering, has to be kept either in some global pointer or
passed back by function. That's it :)