使用链表基本实现的C++中的分段故障(核心转储)

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

class LinkedList {
public:
    LinkedList();
    void insertNode(int data);
    void dumpCore(); // 核心转储函数
private:
    Node* head;
};

LinkedList::LinkedList() {
    head = nullptr;
}

void LinkedList::insertNode(int data) {
    Node* newNode = new Node;
    newNode->data = data;
    newNode->next = nullptr;

    if (head == nullptr) {
        head = newNode;
    } else {
        Node* currNode = head;
        while (currNode->next != nullptr) {
            currNode = currNode->next;
        }
        currNode->next = newNode;
    }
}

void LinkedList::dumpCore() {
    std::ofstream file("core_dump.txt");
    Node* currNode = head;
    while (currNode != nullptr) {
        file << currNode->data << std::endl;
        currNode = currNode->next;
    }
    file.close();
}