CareerCup

One way to do this
1. delete from the head of the given linked list n push it into a stack
2. Then pop from the stack and create a linked list by adding the elements popped to the tail of the linked list.

But this is space consuming as you create a stack and then a fresh linked list.

Can someone think of a simpler solution ?

void Reverse(Node * head){
if(!head && !head->next) return;
Node *remaining = Reverse(head->next);
head->next->next = head;
head->next =NULL;
}

Node* Reverse(Node *head)
{
if (!head || !head->next) return head;
Node * remaining = Reverse (head->next);
head->next->next = head;
head->next = NULL;
return remaining;
}