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;
}