CareerCup

Recursion will use the internal stack space .. you can do following::

First traverse the link list and reverse it 
then traverse it and print it 
 
If there is any constraint that list should be as it is then reverse it again

Yo

This can be done via recursion.

function printLinkedLits(Node head)
{
while(head->next!null)
printLinkedList(head->next);

printf(head);
}

recursion!!!...are you not using function's internal stack as extra space at each level of recursion to store the node???

void reverse(node *head)
{
if(head==NULL)
return;
else
{
reverse(head->next);
printf("%d ",head->data);
return;
}
}