How do I traverse a doubly linked list?

How do I traverse a doubly linked list?

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

What if I want to traverse it in reverse?

You can traverse it in reverse by starting from the tail node and using the previous pointers to move backward.

Can you show me a code example?

Sure! Here's a simple example in Python:

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_forward(self):
        current = self.head
        while current:
            print(current.data)
            current = current.next

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

What are the advantages of using a doubly linked list?

Doubly linked lists allow for easier traversal in both directions and can simplify certain operations like deletion.