Recursively reversingsingly linkedlist in c plus plus?

Answer 1

Don't know how you'd do it recursively, but an iterative version might look something like:

struct Node {

int data;

Node* next;

};

struct List {

Node* head;

};

void reverse(List& list) {

Node* head = list.head;
Node* next;

if (head == 0) return;

while (next = head->next) {
head->next = next->next;
next->next = list.head;
list.head = next;

}

}

This is untested, but the gist is simple: for each element in the list, move it to the front of the list.