Python-链表

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


def create_linklist_head(li):
    # 头插法：从链表的表头开始插入，每插入一个数，表头都会变成当前的这个数
    head = Node(li[0])
    for element in li[1:]:
        node = Node(element)
        node.next = head
        head = node
    return head


def create_linklist_tail(li):
    head = Node(li[0])
    tail = head
    for element in li[1:]:
        node = Node(element)
        tail.next = node
        tail = node
    return head

def print_linklist(lk):
    while lk:
        print(lk.item, end=",")
        lk = lk.next


lk = create_linklist_tail([1, 2, 3, 4, 6, 7, 8])
print_linklist(lk)