我们如何从链表中的第n个元素遍历到最后一个元素？

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

def traverse_from_n_to_end(head, n):
    if head is None:
        return "链表为空"

    if n < 1:
        return "无效的n值"

    current = head

    # 将current指针向后移动n-1个位置
    for _ in range(n-1):
        if current.next is None:
            return "n超出链表长度"
        current = current.next

    # 遍历并处理从第n个节点到最后一个节点
    while current is not None:
        # 处理或获取当前节点的数据
        print(current.data)
        current = current.next

# 创建链表
node1 = Node("A")
node2 = Node("B")
node3 = Node("C")
node4 = Node("D")
node5 = Node("E")

node1.next = node2
node2.next = node3
node3.next = node4
node4.next = node5

# 从第3个元素开始遍历到最后一个元素
traverse_from_n_to_end(node1, 3)