创建一个链表，要求结点的数值以增序排列伪代码

创建一个递增顺序排列的链表的伪代码可以这样描述：

// 定义节点结构
Node:
    data: 整型 // 节点值
    next: Node pointer // 指向下一个节点的指针

// 初始化空链表
function createEmptyLinkedList():
    return None

// 插入节点并保持递增顺序
function insertSorted(head, value):
    if head is None or value < head.data:
        new_node = Node(value)
        new_node.next = head
        return new_node
    else:
        current = head
        while current.next and value > current.next.data:
            current = current.next
        new_node = Node(value)
        new_node.next = current.next
        current.next = new_node
        return head

// 遍历链表检查排序
function isListSorted(head):
    current = head
    while current and (current.next and current.data <= current.next.data):
        current = current.next
    return current is None

// 主函数示例
def main():
    head = createEmptyLinkedList()
    # 插入节点
    head = insertSorted(head, 5)   # [5]
    head = insertSorted(head, 2)   # [2, 5]
    head = insertSorted(head, 8)   # [2, 5, 8]
    
    # 检查链表是否按升序排列
    print(isListSorted(head))  # 输出 True