How do I traverse a doubly linked list in programming?

How do I traverse a doubly linked list in programming?

To traverse a doubly linked list, you can start from the head node and move through the list using the next and previous pointers.

Can you show me a code example in Python?

Sure! Here's a simple example:

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

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

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

What if I want to traverse it in reverse?

You can start from the tail node and use the prev pointer to move backwards through the list. Here's how:

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