如何用C++将缓冲区表示为链表

#include <iostream>

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

Node* createLinkedList(char* buffer, int size) {
    Node* head = nullptr;
    Node* prev = nullptr;

    for (int i = 0; i < size; i++) {
        Node* newNode = new Node;
        newNode->data = buffer[i];
        newNode->next = nullptr;

        if (head == nullptr) {
            head = newNode;
        } else {
            prev->next = newNode;
        }

        prev = newNode;
    }

    return head;
}

void printLinkedList(Node* head) {
    Node* current = head;

    while (current != nullptr) {
        std::cout << current->data << " ";
        current = current->next;
    }

    std::cout << std::endl;
}

void deleteLinkedList(Node* head) {
    Node* current = head;

    while (current != nullptr) {
        Node* next = current->next;
        delete current;
        current = next;
    }
}

int main() {
    char buffer[] = "Hello, World!";
    int size = sizeof(buffer) - 1;

    Node* linkedList = createLinkedList(buffer, size);
    printLinkedList(linkedList);
    deleteLinkedList(linkedList);

    return 0;
}