How do I reverse a linked list in programming?

How do I reverse a linked list in programming?

To reverse a linked list, you can use an iterative or recursive approach. Which one would you like to learn 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.

What does the code look like for that?

Here's a simple example in Python:

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

def reverse_linked_list(head):
    prev = None
    current = head
    while current:
        next_node = current.next  # Store next node
        current.next = prev      # Reverse the link
        prev = current           # Move prev and current one step forward
        current = next_node
    return prev  # New head of the reversed list