如何在链接列表中正确返回插入的元素

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

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

    def insert(self, data, position):
        if position < 0 or position > self.length():
            print("Invalid position")
            return

        new_node = Node(data)

        if position == 0:
            new_node.next = self.head
            self.head = new_node
        else:
            current = self.head
            for _ in range(position - 1):
                current = current.next
            new_node.next = current.next
            current.next = new_node

    def length(self):
        count = 0
        current = self.head
        while current:
            count += 1
            current = current.next
        return count

    def display(self):
        current = self.head
        while current:
            print(current.data, end=" ")
            current = current.next
        print()

# 创建一个链接列表
linked_list = LinkedList()

# 在链接列表中插入元素
linked_list.insert(1, 0)  # 在位置0插入元素1
linked_list.insert(2, 1)  # 在位置1插入元素2
linked_list.insert(3, 2)  # 在位置2插入元素3

# 显示链接列表
linked_list.display()  # 输出：1 2 3