使用函数向链表添加元素时为何无法正确执行？

Hey Alexander, let's break down why your linked list is acting up when you use a separate add() function—this is a super common pitfall with linked lists, so you're not alone here!

The Most Likely Culprit: Incorrect Pointer Passing #

Chances are, your add() function is modifying a copy of your linked list head pointer instead of the original one in main(). Here's what that might look like (using C-style code as an example):

Wrong Implementation #

// This won't work because we're passing the head by value
void add(Node head, Node new_student) {
    if (head == NULL) {
        head = new_student; // Only changes the local copy, not main's head
        return;
    }
    Node current = head;
    while (current->next != NULL) {
        current = current->next;
    }
    current->next = new_student;
}

When you call this from main(), the head inside add() is a separate variable. Any changes you make to it (like setting it to the first node when the list is empty) won't affect the original head pointer in main()—so your list stays empty, leading to abnormal output.

Fix: Pass the Head by Pointer-to-Pointer (C) or Reference (C++) #

To modify the original head pointer, you need to pass its address (a double pointer) or use a reference (if you're using C++):

C Solution (Pointer-to-Pointer)

void add(Node *head, Node new_student) {
    if (*head == NULL) {
        *head = new_student; // Now we modify the original head in main()
        return;
    }
    Node current = *head;
    while (current->next != NULL) {
        current = current->next;
    }
    current->next = new_student;
}

// Call it from main like this:
add(&head, stu2);
add(&head, stu3);

C++ Solution (Reference)

void add(Node* &head, Node* new_student) {
    if (head == nullptr) {
        head = new_student;
        return;
    }
    Node* current = head;
    while (current->next != nullptr) {
        current = current->next;
    }
    current->next = new_student;
}

// Call it from main like this:
add(head, stu2);
add(head, stu3);

Other Possible Issues to Check #

If the pointer fix doesn't solve it, here are two more things to verify:

• Invalid Memory for New Nodes: If you're creating student nodes as local variables (stack memory) inside a function, that memory gets freed when the function exits. You'll end up with dangling pointers. Always use malloc() (C) or new (C++) to allocate heap memory for nodes:

  Node create_student(int data) {
      Node student = (Node)malloc(sizeof(struct StudentNode));
      student->data = data;
      student->next = NULL;
      return student;
  }
  

• Print Function Edge Cases: Double-check that your print function handles empty lists correctly, and that it traverses all nodes until it hits NULL (no off-by-one errors). Since it worked when adding directly in main(), this is less likely—but it never hurts to confirm!

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