Using recursion reverse a singly linked list?

Answer 1

Let's suppose your list consists of elements that have an integer part (the data) and a reference (or pointer) to the next list element.

Now your function would look like this:

void Reverse(listitem){
if(listitem.next exists) //you have to check this in a way depending on your implementation
Reverse(listitem.next); //the function goes right onto the next element
print(listitem.data); //or do anything that is needed
}

In a nutshell, this function first explores the whole linked list, and when it reaches the end, the individual function calls reach the data processing block, and then terminate, thus giving the control back to the previous listelement's function call.