node *reverse(node *first)


{
node *cur,*temp;


cur=NULL;

while(first!=NULL)


{temp=first;

first=first->link;

temp->link=cur;

cur=temp;
}

return cur;

}

reverse a linked list -> by creating a new list.

consider home as the stationary pointer of the original list
adn start as the stationary pointer of the new linked list..

the node structure is as follows:

struct node
{
  int data;
  struct node * next;
}

struct node * reverse(struct node *home , struct node * 
start)
temp = home;
while(temp != NULL)
{
  p = (struct node *) malloc (sizeof(struct node));
  p -> data = temp -> data;
  p -> next = NULL;

  if(start == NULL)
    start = p;
  
  else
  {
    p -> next = start;
    start = p;
  }

temp = temp -> next;

return start;
}

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 :)