如何用c++实现一个链表 单链表的创建、插入和删除【数据结构】

struct ListNode {
    int val;
    ListNode* next;
    ListNode(int x) : val(x), next(nullptr) {}
};
<p>class LinkedList {
private:
ListNode* head;
public:
LinkedList() : head(nullptr) {}
~LinkedList(); // 后续需实现析构释放内存
};

void insertAtHead(int value) {
    ListNode* newNode = new ListNode(value);
    newNode->next = head;
    head = newNode;
}

void insertAt(int index, int value) {
    if (index == 0) {
        insertAtHead(value);
        return;
    }
    ListNode* prev = head;
    for (int i = 0; i < index - 1 && prev != nullptr; ++i) {
        prev = prev->next;
    }
    if (prev == nullptr) return; // 位置无效
    ListNode* newNode = new ListNode(value);
    newNode->next = prev->next;
    prev->next = newNode;
}

void deleteByValue(int value) {
    if (!head) return;
    if (head->val == value) {
        ListNode* temp = head;
        head = head->next;
        delete temp;
        return;
    }
    ListNode* prev = head;
    while (prev->next && prev->next->val != value) {
        prev = prev->next;
    }
    if (prev->next) {
        ListNode* toDelete = prev->next;
        prev->next = toDelete->next;
        delete toDelete;
    }
}

void print() {
    ListNode* cur = head;
    while (cur) {
        std::cout << cur->val;
        if (cur->next) std::cout << " → ";
        cur = cur->next;
    }
    std::cout << std::endl;
}

LinkedList::~LinkedList() {
    while (head) {
        ListNode* temp = head;
        head = head->next;
        delete temp;
    }
}