如何在链表末尾添加节点？

#include <iostream>

struct Node {
    int data;
    Node* next;
};

void appendNode(Node** head, int value) {
    // 创建新节点
    Node* newNode = new Node();
    newNode->data = value;
    newNode->next = NULL;

    // 如果链表为空，将新节点作为头节点
    if (*head == NULL) {
        *head = newNode;
        return;
    }

    // 遍历链表找到最后一个节点
    Node* current = *head;
    while (current->next != NULL) {
        current = current->next;
    }

    // 将新节点添加到链表的末尾
    current->next = newNode;
}

void printList(Node* head) {
    Node* current = head;
    while (current != NULL) {
        std::cout << current->data << " ";
        current = current->next;
    }
    std::cout << std::endl;
}

int main() {
    Node* head = NULL;

    // 添加节点到链表末尾
    appendNode(&head, 1);
    appendNode(&head, 2);
    appendNode(&head, 3);

    // 打印链表
    printList(head);

    return 0;
}