如何在c++中将文件的每一行都分配给双向链表的节点？

#include <iostream>
#include <fstream>
#include <string>

struct Node {
    Node* prev;
    Node* next;
    std::string data;
};

std::ifstream file("filename.txt");
std::string line;
while (std::getline(file, line)) {
    // 将每一行分配给双向链表的节点
}
file.close();

Node* newNode = new Node;
newNode->data = line;

if (head == nullptr) {
    // 如果链表为空，将新节点设为头节点
    head = newNode;
    tail = newNode;
} else {
    // 如果链表不为空，将新节点插入到链表末尾
    tail->next = newNode;
    newNode->prev = tail;
    tail = newNode;
}

#include <iostream>
#include <fstream>
#include <string>

struct Node {
    Node* prev;
    Node* next;
    std::string data;
};

int main() {
    Node* head = nullptr;
    Node* tail = nullptr;

    std::ifstream file("filename.txt");
    std::string line;
    while (std::getline(file, line)) {
        Node* newNode = new Node;
        newNode->data = line;

        if (head == nullptr) {
            head = newNode;
            tail = newNode;
        } else {
            tail->next = newNode;
            newNode->prev = tail;
            tail = newNode;
        }
    }
    file.close();

    // 遍历链表并输出每个节点的内容
    Node* currentNode = head;
    while (currentNode != nullptr) {
        std::cout << currentNode->data << std::endl;
        currentNode = currentNode->next;
    }

    // 释放链表节点的内存
    currentNode = head;
    while (currentNode != nullptr) {
        Node* nextNode = currentNode->next;
        delete currentNode;
        currentNode = nextNode;
    }

    return 0;
}