Following is reursive way of reversing a singly linked list.

RevList.cpp

/* Linked List Node structure
   struct Node  {
     int data;
     Node *next;
  }
*/
// Should reverse list and return new head.

Node* fun(Node* head,Node* prev){
    if(head==0)
       return head;
     if(head->next==0)
     {
         head->next = prev;
         return head;
     }
     Node* temp = fun(head->next,head);
     head->next = prev;
     return temp;
}
Node* reverse(Node *head)
{
   return fun(head,0);
}