How can I reverse a linked list in Python?

How can I reverse a linked list in Python?

You can reverse a linked list in Python by iterating through the list and changing the pointers. Would you like a code example?

Yes, please provide a code example.

Here's a simple implementation:

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

class LinkedList:
    def __init__(self):
        self.head = None

    def reverse(self):
        prev = None
        current = self.head
        while current:
            next_node = current.next  # Store next node
            current.next = prev       # Reverse current node's pointer
            prev = current            # Move pointers one position forward
            current = next_node
        self.head = prev

This code defines a linked list and a method to reverse it.

What if I want to reverse it recursively?

You can reverse a linked list recursively by using a helper function. Here's an example:

def reverse_recursive(node):
    if not node or not node.next:
        return node
    new_head = reverse_recursive(node.next)
    node.next.next = node
    node.next = None
    return new_head

This function will reverse the linked list recursively.