How do I reverse a linked list in C++?

How do I reverse a linked list in C++?

To reverse a linked list in C++, you can use an iterative or recursive approach. Which one would you like to know about?

Can you explain the iterative approach?

Sure! In the iterative approach, you maintain three pointers: previous, current, and next. You traverse the list and reverse the links one by one.

What does the code look like for that?

Here's a simple implementation:

struct Node {
    int data;
    Node* next;
};

Node* reverse(Node* head) {
    Node* prev = nullptr;
    Node* current = head;
    Node* next = nullptr;
    while (current != nullptr) {
        next = current->next;
        current->next = prev;
        prev = current;
        current = next;
    }
    return prev;
}

This will reverse the linked list.

Thanks! How do I test this function?

You can create a linked list, call the reverse function, and then print the list to verify the reversal. Would you like an example?