在python中使用递归方式而不是迭代的方式来反向双向链表

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

def reverse_doubly_linked_list(node):
    if node is None:
        return None
    if node.next is None:
        return node
    head = reverse_doubly_linked_list(node.next)
    node.next.next = node
    node.prev = None
    node.next = None
    return head

# 创建一个双向链表示例
head = Node(1)
node2 = Node(2)
node3 = Node(3)
head.next = node2
node2.prev = head
node2.next = node3
node3.prev = node2

# 反向链表
reversed_head = reverse_doubly_linked_list(head)

# 遍历输出反向链表
current = reversed_head
while current is not None:
    print(current.value)
    current = current.next