当递归地在单链表中的特定位置插入节点时，如何输出正确的链表？

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

def insert_node(head, value, position):
    if not head:
        return ListNode(value)
    
    if position == 0:
        new_node = ListNode(value, head)
        return new_node
    
    head.next = insert_node(head.next, value, position - 1)
    return head

def print_list(head):
    current = head
    while current:
        print(current.value, end=" -> ")
        current = current.next
    print("None")

# 示例用法
head = ListNode(1)
head.next = ListNode(2)
head.next.next = ListNode(3)

print("原始链表:")
print_list(head)

new_head = insert_node(head, 4, 2)
print("插入节点后的链表:")
print_list(new_head)