C: Write a compact code to reverse the singly linked list using recursion?

Question

I am looking for sample code which can impress an interviewer.

Answer 1

I wrote a function and tested. Code is as following:

void rvsLinkedLst(Node *node, Node **newHead)
{
if (node == NULLP || node->next == NULLP)
{
*newHead = node;
return;
}
rvsLinkedLst(node->next, newHead);
node->next->next = node;
node->next = NULLP;
}

Answer 2

Hi Neeraj, Your code can be optimized as following:

Node* rvsLinkedLst(Node *node)
{
Node *newHead = NULLP;
if (node == NULLP || node->next == NULLP)
{
return node;
}
new Head = rvsLinkedLst(node->next);
node->next->next = node;
node->next = NULLP;
return newHead;
}