How do I reverse a doubly linked list in Python?

How do I reverse a doubly linked list in Python?

To reverse a doubly linked list, you need to swap the next and previous pointers for each node.

Can you show me a code example?

Sure! Here's a simple implementation:

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

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

    def reverse(self):
        current = self.head
        temp = None
        while current:
            temp = current.prev
            current.prev = current.next
            current.next = temp
            current = current.prev
        if temp:
            self.head = temp.prev

What if the list is empty?

If the list is empty, the head will be None, and the reverse function should handle that case gracefully.