Concept: Mỗi node trỏ tới node kế tiếp.

Example:

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

head = Node(1)
head.next = Node(2)
head.next.next = Node(3)

curr = head
while curr:
    print(curr.val)
    curr = curr.next

Key points:

• Insert đầu: O(1)
• Insert cuối: O(n)