C++代码编辑基于链存储结构的图书信息表的逆序存储

在C++中，如果你想要基于链式存储结构实现一个逆序存储的图书信息表，首先你需要定义一个节点类BookNode来表示图书的信息，包括书名、作者等字段，并设置指针链接到下一个节点。然后创建一个双向链表，因为逆序存储通常意味着从最后一个元素开始遍历。

以下是简单的步骤描述：

1. **定义节点类** (BookNode):

class BookNode {
public:
    string title;
    string author;
    BookNode* prev; // 指向前一个节点
    BookNode* next; // 指向前一个节点
};

2. **创建链表头结点** 和初始操作：

BookNode* head = new BookNode();
head->prev = nullptr;
head->next = nullptr;

3. **添加新书信息并调整链表**:

void addBook(BookNode*& current, const string& title, const string& author) {
    BookNode* newNode = new BookNode();
    newNode->title = title;
    newNode->author = author;
    newNode->prev = current;
    newNode->next = current->prev;

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

    current = newNode;
}

4. **逆序访问图书信息**:

void traverseReverse(BookNode* node) {
    while (node != nullptr) {
        cout << "Title: " << node->title << ", Author: " << node->author << endl;
        node = node->prev;
    }
}

5. **删除节点（为了维持逆序）**:

void deleteNode(BookNode*& current, BookNode* nodeToDelete) {
    if (nodeToDelete == current) {
        current = current->prev;
    } else {
        nodeToDelete->prev->next = nodeToDelete->next;
        if (nodeToDelete->next != nullptr) {
            nodeToDelete->next->prev = nodeToDelete->prev;
        }
    }
    delete nodeToDelete;
}