How do I traverse a linked list in Python?

How do I traverse a linked list in Python?

To traverse a linked list in Python, you start from the head node and follow the next pointers until you reach the end.

Can you show me a code example?

Sure! Here's a simple example:

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

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

    def append(self, data):
        new_node = Node(data)
        if not self.head:
            self.head = new_node
            return
        last = self.head
        while last.next:
            last = last.next
        last.next = new_node

    def traverse(self):
        current = self.head
        while current:
            print(current.data)
            current = current.next

# Example usage:
ll = LinkedList()
ll.append(1)
ll.append(2)
ll.append(3)
ll.traverse()

What if I want to traverse it in reverse?

To traverse a linked list in reverse, you typically need to use a stack or modify the linked list to include previous pointers, as standard singly linked lists do not support reverse traversal.