CareerCup

Recursively using 1 extra variable:

void Reverse(node *&head)
{
	if(head==NULL)
		return;
	node *fwd=head->next;
	if(fwd==NULL)
		return;
	 else
	 {
	 	     Reverse(fwd);
	 }
	 head->next->next=head;
	 head->next=NULL;
	 head=fwd;

}

The recursive method is possible, but for me, it is hard to follow.

Iterative one is easy.

void reverse(node **head) {
if (!*head) return;

node *cur = *head;
node *prev = NULL;
node *next = NULL;

while (cur) {
next = cur->next;
cur->next = prev;

prev = cur;
cur = next;
}

*head = prev;

return;
}

sorry, my mistake. your code is correct.

void reverse(Node *ptr, Node *prev)
{
      if(ptr->next == NULL)
      {
             ptr->next = prev;
             return ptr;
      }
     else
     {
          Node *temp = reverse(ptr->next, ptr);
          ptr->next =prev;
          return temp;
      }