关于#c++#的问题：C++数据结构二叉树单链表建一个图书管理系统删除图书操作有问题

C++数据结构二叉树单链表建一个图书管理系统删除图书操作有问题，怎么也改不出来<<endl;

#include <iostream>
#include<string>
using namespace std;

typedef string ElemType;
typedef int Status;
string anything;

#define TRUE 1;
#define FALSE 0;
#define OK 1;
#define ERROR 0;
#define MAXSIZE 999999;

typedef struct Book {
    string bookID; //书号
    string bookName; //书名
    string writerName; //作者
    int booknumnow; //现库存量
    string biglei; //大类
    string smalllei; //小类
}Book, * Bookk; //书本类型

typedef struct LNode //链表
{
    Book* book;
    struct LNode* next;
}LNode, * LinkList;
typedef struct FiveTNode//每一层有五类 
{
    ElemType data;
    struct FiveTNode* child1, * child2, * child3, * child4, * child5;
    LNode* lnode;
}FiveTNode, * FiveTree;
Status CreateFiveTree(FiveTree& T, FiveTree& A, FiveTree& B, FiveTree& C, FiveTree& D, FiveTree& E)//创建树 
{
    T = new FiveTNode;//生成根结点
    T->data = "图书";
    T->child1 = new FiveTNode;
    T->child2 = new FiveTNode;
    T->child3 = new FiveTNode;
    T->child4 = new FiveTNode;
    T->child5 = new FiveTNode;

    A = T->child1;
    B = T->child2;
    C = T->child3;
    D = T->child4;
    E = T->child5;

    A->data = "文化";
    B->data = "自然科学";
    C->data = "中国名著";
    D->data = "外国名著";
    E->data = "综合类书籍";

    A->child1 = new FiveTNode;
    A->child2 = new FiveTNode;
    A->child3 = new FiveTNode;
    A->child4 = new FiveTNode;
    A->child5 = new FiveTNode;

    A->child1->data = "哲学";
    A->child2->data = "历史";
    A->child3->data = "政治";
    A->child4->data = "国学";
    A->child5->data = "民族";

    B->child1 = new FiveTNode;
    B->child2 = new FiveTNode;
    B->child3 = new FiveTNode;
    B->child4 = new FiveTNode;
    B->child5 = new FiveTNode;

    B->child1->data = "生物";
    B->child2->data = "物种";
    B->child3->data = "地理";
    B->child4->data = "基因";
    B->child5->data = "生命";

    C->child1 = new FiveTNode;
    C->child2 = new FiveTNode;
    C->child3 = new FiveTNode;
    C->child4 = new FiveTNode;
    C->child5 = new FiveTNode;

    C->child1->data = "古代神话";
    C->child2->data = "古代奇幻";
    C->child3->data = "现代小说";
    C->child4->data = "古代小说";
    C->child5->data = "现代散文";

    D->child1 = new FiveTNode;
    D->child2 = new FiveTNode;
    D->child3 = new FiveTNode;
    D->child4 = new FiveTNode;
    D->child5 = new FiveTNode;

    D->child1->data = "古代小说";
    D->child2->data = "现代小说";
    D->child3->data = "现代散文";
    D->child4->data = "古代散文";
    D->child5->data = "童话";

    E->child1 = new FiveTNode;
    E->child2 = new FiveTNode;
    E->child3 = new FiveTNode;
    E->child4 = new FiveTNode;
    E->child5 = new FiveTNode;

    E->child1->data = "交通运输";
    E->child2->data = "工业技术";
    E->child3->data = "航空航天";
    E->child4->data = "环境科学";
    E->child5->data = "安全科学";

    A->child1->lnode = new LNode;
    A->child1->lnode->book = new Book;
    A->child2->lnode = new LNode;
    A->child2->lnode->book = new Book;
    A->child3->lnode = new LNode;
    A->child3->lnode->book = new Book;
    A->child4->lnode = new LNode;
    A->child4->lnode->book = new Book;
    A->child5->lnode = new LNode;
    A->child5->lnode->book = new Book;

    B->child1->lnode = new LNode;
    B->child1->lnode->book = new Book;
    B->child2->lnode = new LNode;
    B->child2->lnode->book = new Book;
    B->child3->lnode = new LNode;
    B->child3->lnode->book = new Book;
    B->child4->lnode = new LNode;
    B->child4->lnode->book = new Book;
    B->child5->lnode = new LNode;
    B->child5->lnode->book = new Book;

    C->child1->lnode = new LNode;
    C->child1->lnode->book = new Book;
    C->child2->lnode = new LNode;
    C->child2->lnode->book = new Book;
    C->child3->lnode = new LNode;
    C->child3->lnode->book = new Book;
    C->child4->lnode = new LNode;
    C->child4->lnode->book = new Book;
    C->child5->lnode = new LNode;
    C->child5->lnode->book = new Book;

    D->child1->lnode = new LNode;
    D->child1->lnode->book = new Book;
    D->child2->lnode = new LNode;
    D->child2->lnode->book = new Book;
    D->child3->lnode = new LNode;
    D->child3->lnode->book = new Book;
    D->child4->lnode = new LNode;
    D->child4->lnode->book = new Book;
    D->child5->lnode = new LNode;
    D->child5->lnode->book = new Book;

    E->child1->lnode = new LNode;
    E->child1->lnode->book = new Book;
    E->child2->lnode = new LNode;
    E->child2->lnode->book = new Book;
    E->child3->lnode = new LNode;
    E->child3->lnode->book = new Book;
    E->child4->lnode = new LNode;
    E->child4->lnode->book = new Book;
    E->child5->lnode = new LNode;
    E->child5->lnode->book = new Book;

    A->child1->lnode->book->bookName = "《哲学起步》";
    A->child1->lnode->book->bookID = "1";
    A->child1->lnode->book->writerName = "邓晓芒";
    A->child1->lnode->book->booknumnow = 11;
    A->child1->lnode->next = NULL;

    A->child2->lnode->book->bookName = "《中国历史文化课》";
    A->child2->lnode->book->bookID = "2";
    A->child2->lnode->book->writerName = "余秋雨";
    A->child2->lnode->book->booknumnow = 11;
    A->child2->lnode->next = NULL;

    A->child3->lnode->book->bookName = "《万古江河》";
    A->child3->lnode->book->bookID = "3";
    A->child3->lnode->book->writerName = "朱卓文";
    A->child3->lnode->book->booknumnow = 23;
    A->child3->lnode->next = NULL;

    A->child4->lnode->book->bookName = "《国学知识大全》";
    A->child4->lnode->book->bookID = "4";
    A->child4->lnode->book->writerName = "吕思勉";
    A->child4->lnode->book->booknumnow = 34;
    A->child4->lnode->next = NULL;

    A->child5->lnode->book->bookName = "《民族文化史》";
    A->child5->lnode->book->bookID = "5";
    A->child5->lnode->book->writerName = "季玉春";
    A->child4->lnode->book->booknumnow = 26;
    A->child5->lnode->next = NULL;

    B->child1->lnode->book->bookName = "《万物简史》";
    B->child1->lnode->book->bookID = "6";
    B->child1->lnode->book->writerName = "达尔文";
    B->child1->lnode->book->booknumnow = 34;
    B->child1->lnode->next = NULL;

    B->child2->lnode->book->bookName = "《物种起源》";
    B->child2->lnode->book->bookID = "7";
    B->child2->lnode->book->writerName = "萨根";
    B->child2->lnode->book->booknumnow = 34;
    B->child2->lnode->next = NULL;

    B->child3->lnode->book->bookName = "《神秘的宇宙》";
    B->child3->lnode->book->bookID = "8";
    B->child3->lnode->book->writerName = "理查德";
    B->child3->lnode->book->booknumnow = 18;
    B->child3->lnode->next = NULL;

    B->child4->lnode->book->bookName = "《自私的基因》";
    B->child4->lnode->book->bookID = "9";
    B->child4->lnode->book->writerName = "吉姆";
    B->child4->lnode->book->booknumnow = 27;
    B->child4->lnode->next = NULL;

    B->child5->lnode->book->bookName = "《神奇的量子力量》";
    B->child5->lnode->book->bookID = "10";
    B->child5->lnode->book->writerName = "萨利";
    B->child5->lnode->book->booknumnow = 27;
    B->child5->lnode->next = NULL;

    C->child1->lnode->book->bookName = "《山海经》";
    C->child1->lnode->book->bookID = "11";
    C->child1->lnode->book->writerName = "邹衍";
    C->child1->lnode->book->booknumnow = 54;
    C->child1->lnode->next = NULL;

    C->child2->lnode->book->bookName = "《西游记》";
    C->child2->lnode->book->bookID = "12";
    C->child2->lnode->book->writerName = "吴承恩";
    C->child2->lnode->book->booknumnow = 32;
    C->child2->lnode->next = NULL;

    C->child3->lnode->book->bookName = "《团圆》";
    C->child3->lnode->book->bookID = "13";
    C->child3->lnode->book->writerName = "张爱玲";
    C->child3->lnode->book->booknumnow = 23;
    C->child3->lnode->next = NULL;

    C->child4->lnode->book->bookName = "《三国演义》";
    C->child4->lnode->book->bookID = "14";
    C->child4->lnode->book->writerName = "罗贯中";
    C->child4->lnode->book->booknumnow = 56;
    C->child4->lnode->next = NULL;

    C->child5->lnode->book->bookName = "《朝花夕拾》";
    C->child5->lnode->book->bookID = "15";
    C->child5->lnode->book->writerName = "鲁迅";
    C->child5->lnode->book->booknumnow = 32;
    C->child5->lnode->next = NULL;

    D->child1->lnode->book->bookName = "《神圣的罗马帝国》";
    D->child1->lnode->book->bookID = "16";
    D->child1->lnode->book->writerName = "新海月";
    D->child1->lnode->book->booknumnow = 24;
    D->child1->lnode->next = NULL;

    D->child2->lnode->book->bookName = "《追风筝的人》";
    D->child2->lnode->book->bookID = "17";
    D->child2->lnode->book->writerName = "卡勒得";
    D->child2->lnode->book->booknumnow = 46;
    D->child2->lnode->next = NULL;

    D->child3->lnode->book->bookName = "《论时机》";
    D->child3->lnode->book->bookID = "18";
    D->child3->lnode->book->writerName = "培根";
    D->child3->lnode->book->booknumnow = 23;
    D->child3->lnode->next = NULL;

    D->child4->lnode->book->bookName = "《诗学》";
    D->child4->lnode->book->bookID = "19";
    D->child4->lnode->book->writerName = "亚里士多德";
    D->child4->lnode->book->booknumnow = 35;
    D->child4->lnode->next = NULL;

    D->child5->lnode->book->bookName = "《安徒生童话》";
    D->child5->lnode->book->bookID = "20";
    D->child5->lnode->book->writerName = "安徒生";
    D->child5->lnode->book->booknumnow = 41;
    D->child5->lnode->next = NULL;

    E->child1->lnode->book->bookName = "《道路交通安全法》";
    E->child1->lnode->book->bookID = "21";
    E->child1->lnode->book->writerName = "郑彩城";
    E->child1->lnode->book->booknumnow = 12;
    E->child1->lnode->next = NULL;

    E->child2->lnode->book->bookName = "《大国重工》";
    E->child2->lnode->book->bookID = "22";
    E->child2->lnode->book->writerName = "吴国忠";
    E->child2->lnode->book->booknumnow = 27;
    E->child2->lnode->next = NULL;

    E->child3->lnode->book->bookName = "《中国航空》";
    E->child3->lnode->book->bookID = "23";
    E->child3->lnode->book->writerName = "沈海军";
    E->child3->lnode->book->booknumnow = 30;
    E->child3->lnode->next = NULL;

    E->child4->lnode->book->bookName = "《环境科学与工程》";
    E->child4->lnode->book->bookID = "24";
    E->child4->lnode->book->writerName = "李思雨";
    E->child4->lnode->book->booknumnow = 21;
    E->child4->lnode->next = NULL;

    E->child5->lnode->book->bookName = "《安全科学你我需知》";
    E->child5->lnode->book->bookID = "25";
    E->child5->lnode->book->writerName = "刘俊";
    E->child5->lnode->book->booknumnow = 58;
    E->child5->lnode->next = NULL;

    return OK;
}

void OutputP(LNode *pa1, LNode *pa2, LNode *pa3, LNode * pa4, LNode * pa5)
{
    //pa1->book = new Book;
    //pa2->book = new Book;
    //pa3->book = new Book;
    //pa4->book = new Book;
    //pa5->book = new Book;
    while (pa1)
    {
        cout << pa1->book->bookID << " " << pa1->book->bookName << " " << pa1->book->writerName << endl;
        pa1 = pa1->next;
    }
    while (pa2)
    {
        cout << pa2->book->bookID << " " << pa2->book->bookName << " " << pa2->book->writerName << endl;
        pa2 = pa2->next;
    }
    while (pa3)
    {
        cout << pa3->book->bookID << " " << pa3->book->bookName << " " << pa3->book->writerName << endl;
        pa3 = pa3->next;
    }
    while (pa4)
    {
        cout << pa4->book->bookID << " " << pa4->book->bookName << " " << pa4->book->writerName << endl;
        pa4 = pa4->next;
    }
    while (pa5)
    {
        cout << pa5->book->bookID << " " << pa5->book->bookName << " " << pa5->book->writerName << endl;
        pa5 = pa5->next;
    }
}

//显示所有图书
void showbook(FiveTree& T, FiveTree& A, FiveTree& B, FiveTree& C, FiveTree& D, FiveTree& E)
{
    system("cls"); //清屏
    LNode *pa1, *pa2, *pa3,* pa4,* pa5,* pb1,* pb2,* pb3, *pb4, *pb5, *pc1, *pc2, *pc3, *pc4, *pc5, *pd1, *pd2, *pd3, *pd4, *pd5, *pe1, *pe2, *pe3, *pe4, *pe5 = new LNode;
    pa1 = A->child1->lnode;
    pa2 = A->child2->lnode;
    pa3 = A->child3->lnode;
    pa4 = A->child4->lnode;
    pa5 = A->child5->lnode;

    pb1 = B->child1->lnode;
    pb2 = B->child2->lnode;
    pb3 = B->child3->lnode;
    pb4 = B->child4->lnode;
    pb5 = B->child5->lnode;

    pc1 = C->child1->lnode;
    pc2 = C->child2->lnode;
    pc3 = C->child3->lnode;
    pc4 = C->child4->lnode;
    pc5 = C->child5->lnode;

    pd1 = D->child1->lnode;
    pd2 = D->child2->lnode;
    pd3 = D->child3->lnode;
    pd4 = D->child4->lnode;
    pd5 = D->child5->lnode;

    pe1 = E->child1->lnode;
    pe2 = E->child2->lnode;
    pe3 = E->child3->lnode;
    pe4 = E->child4->lnode;
    pe5 = E->child5->lnode;
    cout << " ***************************************" << endl;
    OutputP(pa1, pa2, pa3, pa4, pa5);
    OutputP(pb1, pb2, pb3, pb4, pb5);
    OutputP(pc1, pc2, pc3, pc4, pc5);
    OutputP(pd1, pd2, pd3, pd4, pd5);
    OutputP(pe1, pe2, pe3, pe4, pe5);
    cout << " ***************************************" << endl;
    cout << "输入任意字符返回！" << endl;
    cin >> anything;
    return;
}

void delete_(LNode* p, string book_delete_name)
{
    while (p->next)
    {
        if (p->next->book->bookName == book_delete_name)
        {
            cout << "删除的具体信息如下" << endl;
            cout << "ID:" << p->next->book->bookID << "书名: " << p->next->book->bookName << "作者： " << p->next->book->writerName << endl;
            p->next = p->next->next;
            delete (p->next);
            cout << "删除成功" << endl;
        }
        p = p->next;
    }
}
void delete_findID(FiveTree& T, FiveTree& A, FiveTree& B, FiveTree& C, FiveTree& D, FiveTree& E, string book_delete_name)//查找ID
{
    string book_delete_ID;
    LNode* pa1, * pa2, * pa3, * pa4, * pa5, * pb1, * pb2, * pb3, * pb4, * pb5, * pc1, * pc2, * pc3, * pc4, * pc5, * pd1, * pd2, * pd3, * pd4, * pd5, * pe1, * pe2, * pe3, * pe4, * pe5 = new LNode;
    pa1 = A->child1->lnode;
    pa2 = A->child2->lnode;
    pa3 = A->child3->lnode;
    pa4 = A->child4->lnode;
    pa5 = A->child5->lnode;

    pb1 = B->child1->lnode;
    pb2 = B->child2->lnode;
    pb3 = B->child3->lnode;
    pb4 = B->child4->lnode;
    pb5 = B->child5->lnode;

    pc1 = C->child1->lnode;
    pc2 = C->child2->lnode;
    pc3 = C->child3->lnode;
    pc4 = C->child4->lnode;
    pc5 = C->child5->lnode;

    pd1 = D->child1->lnode;
    pd2 = D->child2->lnode;
    pd3 = D->child3->lnode;
    pd4 = D->child4->lnode;
    pd5 = D->child5->lnode;

    pe1 = E->child1->lnode;
    pe2 = E->child2->lnode;
    pe3 = E->child3->lnode;
    pe4 = E->child4->lnode;
    pe5 = E->child5->lnode;

    delete_(pa1, book_delete_name);
    delete_(pa2, book_delete_name);
    delete_(pa3, book_delete_name);
    delete_(pa4, book_delete_name);
    delete_(pa5, book_delete_name);
    delete_(pb1, book_delete_name);
    delete_(pb2, book_delete_name);
    delete_(pb3, book_delete_name);
    delete_(pb4, book_delete_name);
    delete_(pb5, book_delete_name);
    delete_(pc1, book_delete_name);
    delete_(pc2, book_delete_name);
    delete_(pc3, book_delete_name);
    delete_(pc4, book_delete_name);
    delete_(pc5, book_delete_name);
    delete_(pd1, book_delete_name);
    delete_(pd2, book_delete_name);
    delete_(pd3, book_delete_name);
    delete_(pd4, book_delete_name);
    delete_(pd5, book_delete_name);
    delete_(pe1, book_delete_name);
    delete_(pe2, book_delete_name);
    delete_(pe3, book_delete_name);
    delete_(pe4, book_delete_name);
    delete_(pe5, book_delete_name);
}
Status ListDelete(FiveTree& T, FiveTree& A, FiveTree& B, FiveTree& C, FiveTree& D, FiveTree& E)//删除
{
    system("cls"); //清屏
    int password;//输入密码验证身份
    cout << "************************************" << endl;
    cout << "*为证明身份，请输入密码：          *" << endl;
    cout << "************************************" << endl;
    cin >> password;
    if (password == 1379)//密码输入正确
    {
        system("cls"); //清屏
        showbook(T, A, B, C, D, E);
        system("cls"); //清屏
        cout << "请输入删除书籍的书名" << endl;
        string book_delete_name;
        cin >> book_delete_name;
        delete_findID(T, A, B, C, D, E, book_delete_name);
    }
    else
    {
        //输入了其他的字符
        system("cls"); //清屏
        cout << " ***************************************" << endl;
        cout << "密码错误！请返回！若非管理员请勿操作此功能！" << endl;
        cout << " ***************************************" << endl;
    }
    return OK;
}


int main()
{
    FiveTree T, A, B, C, D, E;
    CreateFiveTree(T, A, B, C, D, E);
    cout << "请在显示的菜单里复制书名！" << endl;
    showbook(T, A, B,C,D,E);
    ListDelete(T,A,B,C,D,E);
    showbook(T, A, B, C, D, E);
}

写回答
好问题 0 提建议
追加酬金
关注问题
分享
邀请回答
编辑收藏删除结题
收藏举报

2条回答默认最新

ABZS 2023-06-13 10:48

关注



```c++
Status DeleteBook(FiveTree T, string biglei, string smalllei, string bookName) {
    FiveTree p = T;
    while (p != NULL) {
        if (p->data == biglei) {
            FiveTree q = p->child1;
            while (q != NULL) {
                if (q->data == smalllei) {
                    LNode* r = q->lnode;
                    LNode* pre = NULL;
                    while (r != NULL) {
                        if (r->book->bookName == bookName) {
                            if (pre == NULL) {
                                q->lnode = r->next;
                            } else {
                                pre->next = r->next;
                            }
                            delete r->book;
                            delete r;
                            return OK;
                        }
                        pre = r;
                        r = r->next;
                    }
                    cout << "Book not found." << endl;
                    return ERROR;
                }
                q = q->child5;
            }
            cout << "Small category not found." << endl;
            return ERROR;
        }
        p = p->child5;
    }
    cout << "Big category not found." << endl;
    return ERROR;
}

```

报告相同问题？

关注问题

关于#c++#的问题：如何实现输入流一个一个放到vector中 c++ 数据结构
2022-12-18 21:13

回答 1 已采纳 int main() { vector<int> a; string s; int m, n, x; cin >> m; while
关于#数据结构#的问题：二叉树推不出来数据结构
2023-03-25 15:52

回答 2 已采纳先序：根，左，右中序：左，根，右后序：左，右，根由后可得E为根，代入中，发现左子树为A，B，C，D这四个点，右子树为F，G，再看后序，发现A为左子树的根，G为右子树的根，而中序中，A是第一个，说明B，
关于#算法#的问题：求 二叉树的查找节点算法的代码和流程图要求用c#语言编写 c# 数据结构算法
2023-01-17 15:57

回答 3 已采纳代码和图如下，有帮助的话记得采纳哦！ class Node { public int Value { get; set; } public Node Left { get; set;
python设计一个图书管理的简单程序用单链表_轻松学做C语言课程设计：图书管理系统-链表实现...
2021-02-11 01:59

灰白光的博客题目要求图书管理系统提供图书信息管理以及借还管理。图书信息至少包括：图书编号、书名、价格、作者、借还状态，提供以下功能：1.增加图书信息，录入；2.查询已有的所有图书信息；3.删除图书；4.修改图书信息；5....
数据结构：复制二叉树代码形参问题 c++ 数据结构
2022-11-03 20:35

回答 1 已采纳这篇文章讲的很详细，请看：数据结构二叉树代码
关于#c++#的问题，如何解决？ c语言数据结构算法
2023-04-17 22:40

回答 5 已采纳引用new bing部分回答作答：以下是可以实现倒立树形式显示二叉排序树的代码： void InvertShow(BSTree T, int level) { if (T == NULL) r
这是一个关于数据结构二叉树的遍历问题 c++
2020-04-25 08:17

回答 4 已采纳拿 https://blog.csdn.net/qq_44556821/article/details/96423326 这个程序改了下。 ``` #include #include us
数据结构与算法（快速基础C++版）
2024-08-27 16:50

Andrew_Xzw的博客 数据结构与算法（快速基础）
数据结构（c＋＋语言）求二叉树的宽度 c++ 数据结构有问必答
2021-11-15 18:49

回答 1 已采纳参考： #include<iostream> #include<stdlib.h> #include<deque> //插入标准库中的头文件 using nam
关于#c语言#的问题：随机生成20个正整数，根据生成的顺序在内存中生成一棵平衡二叉树并在控制台输出该树 b树 c语言数据结构有问必答
2022-05-04 22:21

回答 2 已采纳你题目的解答代码如下： #include <stdio.h> #include <stdlib.h> #include <assert.h> #include &l
这是一个数据结构二叉树的相关问题 c++
2020-04-30 13:31

回答 3 已采纳递归遍历代码简洁，首先推荐非递归遍历，不受递归深度限制，效率高，如果前者性能遇到问题，再用这个办法, 这也是一个原则性，你应该了解编写程序的一般做法是，先用最简单的方式实现出来，再对
C/C++数据结构与算法课程设计选题详情[2023-02-23]
2023-02-23 12:18

_程序设计_的博客首先实现一个以链表作存储结构的栈类型，然后编写一个求解迷宫的非递归程序。求得的通路以三元组（i，j，d）的形式输出。其中：（i，j）指示迷宫中的一个坐标，d表示走到下一坐标的方向。如，对于下列数据的迷宫，...
95+ 数据结构课程设计电梯模拟系统西文图书管理系统
2024-06-04 14:06

云炬网络的博客至此，课程设计已经告一段落。本次课程时间复杂度和空间...回顾这一学期的《数据结构》课程，因为从一开始就认识到了它的重要性，所以每次课程和上机都非常重视，在这一个学期的学习中，学习到了很多编程的数据结构。
C/C++数据结构课程设计[2023-05-31]
2023-06-01 19:16

codehelper666的博客 数据结构课程设计实验（训）指导书所在学院：计算机科学与工程学院编写说明一．实验总体目标《数据结构》是一门实践性较强的课程，为了学好这门课程，必须在掌握理论知识的同时，加强上机实践。本实验的目标是，学生...
python数据结构与算法书籍_资料分享：送你一本《数据结构与算法：Python语言描述》电子书！...
2020-12-08 12:13

weixin_39654245的博客下图为 TIOBE 3月编程语言排行榜。TIOBE排行榜从榜单来看，曾经铁打的 Java、C、C++ 局势，早已在数月前被 Python 的闯入而打破。究其根由，并非是 C++ 的应用领域正在逐渐缩减，而是随着人工智能、机器学习的崛起，...
没有解决我的问题, 去提问

问题事件

关注

码龄粉丝数原力等级 --

被采纳

被点赞

采纳率
创建了问题 6月13日

悬赏问题

¥15 校内二手商品转让网站
¥20 高德地图聚合图层MarkerCluster聚合多个点，但是ClusterData只有其中部分数据，原因应该是有经纬度重合的地方点，现在我想让ClusterData显示所有点的信息，如何实现？
¥100 求Web版SPC控制图程序包调式
¥20 指导如何跑通以下两个Github代码
¥15 大家知道这个后备文件怎么删吗，为啥这些文件我只看到一份，没有后备呀
¥15 C++为什么这个代码没报错运行不出来啊
¥15 一道ban了很多东西的pyjail题
¥15 关于#r语言#的问题：如何将生成的四幅图排在一起，且对变量的赋值进行更改，让组合的图漂亮、美观@（相关搜索：森林图）
¥15 C++识别堆叠物体异常
¥15 微软硬件驱动认证账号申请

关于#c++#的问题：C++数据结构 二叉树 单链表建一个图书管理系统 删除图书操作有问题

2条回答 默认 最新

问题事件

悬赏问题

关于#c++#的问题：C++数据结构二叉树单链表建一个图书管理系统删除图书操作有问题

2条回答默认最新