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.

Could you provide a code example?

Absolutely! Here's a simple code snippet:

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

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

This function reverses the linked list and returns the new head.

What about the recursive method?

In the recursive method, you reverse the rest of the list and then adjust the pointers. Would you like to see the code for that?