How do I reverse a singly linked list?

How do I reverse a singly linked list?

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

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


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

Thanks! How do I test this function?

You can create a linked list, call the reverse_linked_list function, and print the reversed list to verify it works.