如何实现环回自身关系的递归？

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

def create_linked_list(values):
    if not values:
        return None

    head = Node(values[0])
    head.next = create_linked_list(values[1:])
    return head

def print_linked_list(node):
    if not node:
        return

    print(node.value)
    print_linked_list(node.next)

values = [1, 2, 3, 4, 5]
linked_list = create_linked_list(values)
print_linked_list(linked_list)