单链表节点插入疑问：是否必须作为首元素添加？可追加至尾部吗？

Great questions—let’s unpack these one by one, since this is a common point of confusion when learning linked lists!

1. 新节点是否必须始终作为第一个元素添加？ #

Absolutely not. There’s no rule that says you have to add new nodes to the front of a singly linked list. The insertion position depends entirely on what you’re using the linked list for.

For example:

• If you’re implementing a stack (LIFO, last-in-first-out), adding to the front makes perfect sense—since you want quick access to the most recently added element, and inserting at the head is an O(1) operation.
• But if you’re building a queue (FIFO, first-in-first-out), you’ll need to add new nodes to the end of the list so that elements are processed in the order they were added.

2. 通常是加在head.next（头部）还是遍历到末尾添加？ #

Again, there’s no "always" here—it’s all about use case and performance:

Adding to the head (head.next) #

This is the faster option, with a time complexity of O(1). You don’t need to traverse the entire list; you just:

1. Set the new node’s next pointer to the current head.next
2. Update head.next to point to the new node

Here’s a quick Python example for head insertion:

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

class SinglyLinkedList:
    def __init__(self):
        self.head = Node(None)  # Dummy head node

    def add_to_head(self, data):
        new_node = Node(data)
        new_node.next = self.head.next
        self.head.next = new_node

Adding to the tail #

This requires traversing the entire list to find the last node (the one where next is None), which makes it an O(n) operation. It’s necessary when you need to preserve the order of insertion, like in a queue.

Example of tail insertion in Python:

def add_to_tail(self, data):
        new_node = Node(data)
        current = self.head
        while current.next is not None:
            current = current.next
        current.next = new_node

Key takeaway #

Choose the insertion method based on your needs: prioritize speed with head insertion, or preserve order with tail insertion. Neither is "better" universally—they’re just tools for different jobs.

内容的提问来源于stack exchange，提问作者Foo