如何在不使用for或while循环的情况下导航链表？

class ListNode:
    def __init__(self, value=0, next=None):
        self.value = value
        self.next = next

def traverse_list(node):
    if node is None:
        return
    print(node.value)  # 处理当前节点
    traverse_list(node.next)  # 递归调用处理下一个节点

# 示例使用
head = ListNode(1, ListNode(2, ListNode(3)))
traverse_list(head)

class ListNode:
    def __init__(self, value=0, next=None):
        self.value = value
        self.next = next

def print_list(node):
    for current in iter(lambda: node, None):
        print(current.value)
        node = node.next

# 示例使用
head = ListNode(1, ListNode(2, ListNode(3)))
print_list(head)