{"id":97462,"date":"2026-08-29T15:24:57","date_gmt":"2026-08-29T07:24:57","guid":{"rendered":"https:\/\/www.wsisp.com\/helps\/97462.html"},"modified":"2026-08-29T15:24:57","modified_gmt":"2026-08-29T07:24:57","slug":"%e5%b5%8c%e5%85%a5%e5%bc%8f%e4%bb%8e0%e5%88%b0%e7%b2%be%e9%80%9a-%e6%95%b0%e6%8d%ae%e7%bb%93%e6%9e%84%e6%80%bb%e7%bb%93%e7%89%b9%e6%ae%8a%e5%ad%97%e7%ac%a6","status":"publish","type":"post","link":"https:\/\/www.wsisp.com\/helps\/97462.html","title":{"rendered":"\u5d4c\u5165\u5f0f\u4ece0\u5230\u7cbe\u901a\u2014\u2014\u6570\u636e\u7ed3\u6784\u603b\u7ed3[\u7279\u6b8a\u5b57\u7b26]"},"content":{"rendered":"

📚\u671f\u672b\u590d\u4e60 \/ \u8bfe\u7a0b\u5b9e\u9a8c\u5fc5\u5907！ \u5b66\u4e60 C \u8bed\u8a00\u6570\u636e\u7ed3\u6784\u7684\u65f6\u5019，\u5f88\u591a\u540c\u5b66\u4f1a\u5934\u75bc\u94fe\u8868\u6307\u9488\u3001\u5185\u5b58\u7ba1\u7406\u3001\u5404\u79cd\u589e\u5220\u6539\u67e5\u903b\u8f91\u3002\u7f51\u4e0a\u4ee3\u7801\u7247\u6bb5\u591a，\u5b8c\u6574\u5e26\u6ce8\u91ca\u5de5\u7a0b\u8f83\u5c11\u3002<\/p>\n

\u672c\u7bc7\u628a\u5e73\u65f6\u5199\u7684\u5168\u5957\u94fe\u5f0f\u6570\u636e\u7ed3\u6784\u4ee3\u7801\u6574\u7406\u51fa\u6765：\u5355\u5411\u94fe\u8868\u3001\u6808\u3001\u961f\u5217\u3001\u53cc\u5411\u94fe\u8868\u3001\u54c8\u5e0c\u8868\u3001\u4e8c\u53c9\u6811\u3002 \u6240\u6709\u4ee3\u7801\u4fdd\u7559\u539f\u59cb\u903b\u8f91\u4e0d\u52a8，\u7ed9\u6bcf\u4e00\u4e2a\u51fd\u6570\u6dfb\u52a0\u6ce8\u91ca，\u6807\u660e\u529f\u80fd\u3001\u53c2\u6570\u3001\u8fd4\u56de\u503c，\u65b9\u4fbf\u8c03\u8bd5，\u4e5f\u53ef\u4ee5\u76f4\u63a5\u7528\u4e8e\u8bfe\u7a0b\u5b9e\u9a8c\u53c2\u8003\u3002<\/p>\n

\u5305\u542b\u7ecf\u5178\u7b97\u6cd5：\u5feb\u6162\u6307\u9488\u3001\u4e8c\u53c9\u6811\u56db\u79cd\u904d\u5386\u3001\u54c8\u5e0c\u51b2\u7a81\u5904\u7406\u3001\u5185\u6838\u4fb5\u5165\u94fe\u8868\u5b9e\u6218\u793a\u4f8b\u3002<\/p>\n

\u6ce8\u610f：\u9700\u8981\u81ea\u884c\u8865\u5168.h\u5934\u6587\u4ef6，\u4ee3\u7801\u52a1\u5fc5\u6ce8\u610fmalloc\u4e4b\u540e\u914d\u5957free，\u907f\u514d\u5185\u5b58\u6cc4\u6f0f\u3002<\/p>\n

📌\u8bf4\u660e：<\/p>\n

  • \u4ee3\u7801\u5747\u4e3a\u94fe\u5f0f\u5b9e\u73b0，\u5168\u90e8\u624b\u52a8\u7ba1\u7406malloc\/free\u5185\u5b58；<\/li>\n
  • \u5934\u6587\u4ef6（*.h）\u53ea\u653e\u7ed3\u6784\u4f53\u3001\u51fd\u6570\u58f0\u660e；.c\u6587\u4ef6\u5b9e\u73b0\u903b\u8f91；<\/li>\n
  • \u9519\u8bef\u5904\u7406：\u5185\u5b58\u5206\u914d\u5931\u8d25\u6253\u5370\u63d0\u793a\u5e76\u8fd4\u56de NULL\/-1；<\/li>\n
    \n

    1\u3001link.c \u6709\u5934\u5355\u5411\u94fe\u8868<\/h3>\n

    \u529f\u80fd\u6982\u8ff0：\u5e26\u5934\u90e8\u54e8\u5175\u8282\u70b9\u7684\u5355\u5411\u94fe\u8868\u3002\u652f\u6301\u5934\u63d2\u3001\u5c3e\u63d2\u3001\u5934\u5220\u3001\u5c3e\u5220\u3001\u6309\u503c\u5220\u9664\u3001\u67e5\u627e\u3001\u4fee\u6539\u3001\u94fe\u8868\u9500\u6bc1；\u5feb\u6162\u6307\u9488\u7b97\u6cd5\u6c42\u4e2d\u95f4\u7ed3\u70b9\u3001\u5012\u6570\u7b2c k \u4e2a\u7ed3\u70b9\u3002<\/p>\n

    #include "link.h"
    \n#include <stdlib.h>
    \n#include <stdio.h>
    \n\/********************************
    \n * \u529f\u80fd: \u521b\u5efa\u6709\u5934\u5355\u5411\u94fe\u8868（\u54e8\u5175\u5934\u8282\u70b9，\u4e0d\u5b58\u4e1a\u52a1\u6570\u636e）
    \n * \u53c2\u6570：\u65e0
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：\u8fd4\u56de\u5934\u7ed3\u70b9\u5730\u5740
    \n *\u5931\u8d25: NULL(malloc\u5185\u5b58\u5206\u914d\u5931\u8d25)
    \n * *****************************\/
    \nLink_Node *create_link()
    \n{
    \nLink_Node *phead = NULL;<\/p>\n

    phead = malloc(sizeof(Link_Node));
    \nif (NULL == phead)
    \n{
    \nprintf("fail malloc\\\\n");
    \nreturn NULL;
    \n}<\/p>\n

    phead->pnext = NULL;
    \nreturn phead;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u5355\u5411\u94fe\u8868\u5934\u90e8\u63d2\u5165\u65b0\u8282\u70b9
    \n * \u53c2\u6570：
    \n *phead：\u94fe\u8868\u54e8\u5175\u5934\u7ed3\u70b9\u5730\u5740
    \n *data: \u9700\u8981\u63d2\u5165\u7684\u4e1a\u52a1\u6570\u636e
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：0
    \n *\u5931\u8d25：-1(malloc\u5931\u8d25)
    \n * ***********************************************\/
    \nint insert_head_link(Link_Node *phead, Data_Type data)
    \n{
    \nLink_Node *pinsert = malloc(sizeof(Link_Node));
    \nif (NULL == pinsert)
    \n{
    \nprintf("fail malloc\\\\n");
    \nreturn -1;
    \n}
    \npinsert->data = data;
    \npinsert->pnext = NULL;
    \npinsert->pnext = phead->pnext;
    \nphead->pnext = pinsert;
    \nreturn 0;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u904d\u5386\u94fe\u8868，\u6253\u5370\u6240\u6709\u6709\u6548\u8282\u70b9\u6570\u636e
    \n * \u53c2\u6570：
    \n *phead：\u94fe\u8868\u54e8\u5175\u5934\u7ed3\u70b9\u5730\u5740
    \n * \u8fd4\u56de\u503c：\u65e0
    \n * ***********************************************\/
    \nvoid link_for_each(Link_Node *phead)
    \n{
    \nLink_Node *p = NULL;
    \np = phead->pnext;
    \nwhile (p != NULL)
    \n{
    \nprintf("%d ", p->data);
    \np = p->pnext;
    \n}
    \nprintf("\\\\n");
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u5224\u65ad\u5355\u5411\u94fe\u8868\u662f\u5426\u4e3a\u7a7a\u94fe\u8868
    \n * \u53c2\u6570：
    \n *phead：\u94fe\u8868\u54e8\u5175\u5934\u7ed3\u70b9\u5730\u5740
    \n * \u8fd4\u56de\u503c：
    \n *\u94fe\u8868\u4e3a\u7a7a：1
    \n *\u94fe\u8868\u975e\u7a7a：0
    \n * ***********************************************\/
    \nint is_empty_link(Link_Node *phead)
    \n{
    \nif (NULL == phead->pnext)
    \n{
    \nreturn 1;
    \n}
    \nreturn 0;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u5355\u5411\u94fe\u8868\u5c3e\u90e8\u63d2\u5165\u65b0\u8282\u70b9
    \n * \u53c2\u6570：
    \n *phead：\u94fe\u8868\u54e8\u5175\u5934\u7ed3\u70b9\u5730\u5740
    \n *data: \u9700\u8981\u63d2\u5165\u7684\u4e1a\u52a1\u6570\u636e
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：0
    \n *\u5931\u8d25：-1(malloc\u5931\u8d25)
    \n * ***********************************************\/
    \nint insert_tail_link(Link_Node *phead, Data_Type data)
    \n{
    \nLink_Node *p = NULL;
    \nLink_Node *pinsert = malloc(sizeof(Link_Node));
    \nif (NULL == pinsert)
    \n{
    \nprintf("fail malloc\\\\n");
    \nreturn -1;
    \n}
    \npinsert->data = data;
    \npinsert->pnext = NULL;<\/p>\n

    if (is_empty_link(phead))
    \n{
    \nphead->pnext = pinsert;
    \n}
    \nelse
    \n{
    \np = phead->pnext;
    \nwhile (p->pnext != NULL)
    \n{
    \np = p->pnext;
    \n}
    \np->pnext = pinsert;
    \n}<\/p>\n

    return 0;
    \n}
    \n\/*********************************************
    \n * \u529f\u80fd：\u5220\u9664\u94fe\u8868\u7b2c\u4e00\u4e2a\u6709\u6548\u8282\u70b9（\u5220\u9664\u5934\u540e\u9762\u8282\u70b9）
    \n * \u53c2\u6570：
    \n *phead：\u94fe\u8868\u54e8\u5175\u5934\u7ed3\u70b9\u5730\u5740
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：0；\u7a7a\u94fe\u8868\u4e5f\u8fd4\u56de0
    \n * ********************************************\/
    \nint delete_head_link(Link_Node *phead)
    \n{
    \nif (is_empty_link(phead))
    \n{
    \nreturn 0;
    \n}
    \nLink_Node *pdel = phead->pnext;
    \nphead->pnext = pdel->pnext;
    \nfree(pdel);
    \nreturn 0;
    \n}
    \n\/*******************************************
    \n * \u529f\u80fd：\u5220\u9664\u94fe\u8868\u5c3e\u6709\u6548\u8282\u70b9
    \n * \u53c2\u6570：
    \n *phead：\u94fe\u8868\u54e8\u5175\u5934\u7ed3\u70b9\u5730\u5740
    \n * \u8fd4\u56de\u503c：\u6210\u529f：0；\u7a7a\u94fe\u8868\u4e5f\u8fd4\u56de0
    \n * *****************************************\/
    \nint delete_tail_link(Link_Node *phead)
    \n{
    \nLink_Node *p = phead->pnext;
    \nif (is_empty_link(phead))
    \n{
    \nreturn 0;
    \n}
    \nelse if (NULL == p->pnext)
    \n{
    \ndelete_head_link(phead);
    \n}
    \nelse
    \n{
    \nwhile (p->pnext->pnext != NULL)
    \n{
    \np = p->pnext;
    \n}
    \nfree(p->pnext);
    \np->pnext = NULL;
    \n}
    \nreturn 0;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u6839\u636edata\u503c\u67e5\u627e\u5bf9\u5e94\u8282\u70b9
    \n * \u53c2\u6570：
    \n *phead：\u94fe\u8868\u54e8\u5175\u5934\u7ed3\u70b9\u5730\u5740
    \n *data：\u5f85\u5339\u914d\u67e5\u627e\u7684\u6570\u636e
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：\u5339\u914d\u5230\u7684\u8282\u70b9\u6307\u9488
    \n *\u5931\u8d25：NULL(\u5934\u6307\u9488\u4e3a\u7a7a \/ \u6ca1\u6709\u627e\u5230\u8282\u70b9)
    \n * ***********************************************\/
    \nLink_Node *find_link(Link_Node *phead, Data_Type data)
    \n{
    \nif (NULL == phead)
    \n{
    \nprintf("phead is null\\\\n");
    \nreturn NULL;
    \n}
    \nLink_Node *p = phead->pnext;
    \nwhile (p)
    \n{
    \nif (p->data == data)
    \n{
    \nreturn p;
    \n}
    \np = p->pnext;
    \n}<\/p>\n

    return NULL;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u4fee\u6539\u94fe\u8868\u6307\u5b9a\u8282\u70b9\u6570\u636e
    \n * \u53c2\u6570：
    \n *phead：\u94fe\u8868\u54e8\u5175\u5934\u7ed3\u70b9\u5730\u5740
    \n *olddata：\u9700\u8981\u88ab\u4fee\u6539\u7684\u65e7\u6570\u636e
    \n *newdata：\u66ff\u6362\u540e\u7684\u65b0\u6570\u636e
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：0
    \n *\u5931\u8d25：-1(\u5934\u6307\u9488\u7a7a \/ \u627e\u4e0d\u5230\u5bf9\u5e94\u8282\u70b9)
    \n * ***********************************************\/
    \nint change_link(Link_Node *phead, Data_Type olddata, Data_Type newdata)
    \n{
    \nif (NULL == phead)
    \n{
    \nprintf("phead is null\\\\n");
    \nreturn -1;
    \n}<\/p>\n

    Link_Node *ptmp = find_link(phead, olddata);
    \nif (NULL == ptmp)
    \n{
    \nreturn -1;
    \n}
    \nptmp->data = newdata;<\/p>\n

    return 0;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u9500\u6bc1\u6574\u4e2a\u94fe\u8868，\u91ca\u653e\u5168\u90e8\u6709\u6548\u8282\u70b9+\u54e8\u5175\u5934\u8282\u70b9
    \n * \u53c2\u6570：
    \n *phead：\u94fe\u8868\u54e8\u5175\u5934\u7ed3\u70b9\u5730\u5740
    \n * \u8fd4\u56de\u503c：\u65e0
    \n * ***********************************************\/
    \nvoid destroy_link(Link_Node *phead)
    \n{
    \nif (NULL == phead)
    \n{
    \nprintf("phead is null\\\\n");
    \nreturn ;
    \n}<\/p>\n

    while (!is_empty_link(phead))
    \n{
    \ndelete_head_link(phead);
    \n}
    \nfree(phead);
    \nreturn ;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u5220\u9664\u94fe\u8868\u4e2d\u7b2c\u4e00\u4e2a\u5339\u914ddata\u7684\u8282\u70b9
    \n * \u53c2\u6570：
    \n *phead：\u94fe\u8868\u54e8\u5175\u5934\u7ed3\u70b9\u5730\u5740
    \n *data：\u5f85\u5220\u9664\u8282\u70b9\u7684\u4e1a\u52a1\u6570\u636e
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：0
    \n *\u5931\u8d25：-1(\u5934\u6307\u9488\u7a7a \/ \u627e\u4e0d\u5230\u5bf9\u5e94\u8282\u70b9)
    \n * ***********************************************\/
    \nint delete_point_node(Link_Node *phead, Data_Type data)
    \n{
    \nif (NULL == phead)
    \n{
    \nprintf("phead is null\\\\n");
    \nreturn -1;
    \n}<\/p>\n

    Link_Node *pdel = NULL;
    \nLink_Node *ppre = phead;
    \nwhile (ppre->pnext != NULL)
    \n{
    \nif (ppre->pnext->data == data)
    \n{
    \npdel = ppre->pnext;
    \nppre->pnext = pdel->pnext;
    \nfree(pdel);
    \nreturn 0;
    \n}
    \nppre = ppre->pnext;
    \n}
    \nreturn -1;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u5feb\u6162\u6307\u9488\u7b97\u6cd5\u67e5\u627e\u94fe\u8868\u4e2d\u95f4\u8282\u70b9
    \n * \u53c2\u6570：
    \n *phead：\u94fe\u8868\u54e8\u5175\u5934\u7ed3\u70b9\u5730\u5740
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：\u4e2d\u95f4\u8282\u70b9\u6307\u9488
    \n *\u5931\u8d25：NULL(\u5934\u7a7a \/ \u94fe\u8868\u4e3a\u7a7a)
    \n * ***********************************************\/
    \nLink_Node * find_mid_node(Link_Node *phead)
    \n{
    \nif (NULL == phead)
    \n{
    \nprintf("phead is null\\\\n");
    \nreturn NULL;
    \n}<\/p>\n

    if (is_empty_link(phead))
    \nreturn NULL;
    \nLink_Node *pfast = phead->pnext;
    \nLink_Node *pslaw = pfast;<\/p>\n

    while (pfast != NULL)
    \n{
    \npfast = pfast->pnext;
    \nif (pfast != NULL)
    \n{
    \npfast = pfast->pnext;
    \npslaw = pslaw->pnext;
    \n}
    \n}
    \nreturn pslaw;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u5feb\u6162\u6307\u9488\u67e5\u627e\u94fe\u8868\u5012\u6570\u7b2cK\u4e2a\u8282\u70b9
    \n * \u53c2\u6570：
    \n *phead：\u94fe\u8868\u54e8\u5175\u5934\u7ed3\u70b9\u5730\u5740
    \n *K：\u5012\u6570\u7b2ck\u4e2a\u8282\u70b9\u4e0b\u6807
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：\u5012\u6570\u7b2cK\u4e2a\u8282\u70b9\u6307\u9488
    \n *\u5931\u8d25：NULL(\u5934\u7a7a \/ \u94fe\u8868\u7a7a \/ K\u503c\u8d85\u51fa\u94fe\u8868\u957f\u5ea6)
    \n * ***********************************************\/
    \nLink_Node *find_last_k_node(Link_Node *phead, int K)
    \n{
    \nif (NULL == phead)
    \n{
    \nprintf("phead is null\\\\n");
    \nreturn NULL;
    \n}
    \nif (is_empty_link(phead))
    \n{
    \nreturn NULL;
    \n}<\/p>\n

    Link_Node *pfast = phead->pnext;
    \nLink_Node *pslow = phead->pnext;
    \nfor (int i = 0; i < K; i++)
    \n{
    \nif (NULL == pfast)
    \n{
    \nreturn NULL;
    \n}
    \npfast = pfast->pnext;
    \n}
    \nwhile (pfast != NULL)
    \n{
    \npfast = pfast->pnext;
    \npslow = pslow->pnext;
    \n}<\/p>\n

    return pslow;
    \n}<\/p>\n

    2\u3001queue.c \u94fe\u5f0f\u961f\u5217<\/h3>\n

    \u529f\u80fd\u6982\u8ff0：\u94fe\u5f0f\u5b9e\u73b0\u961f\u5217，\u9075\u5faa\u5148\u8fdb\u5148\u51fa FIFO\u3002\u961f\u5217\u63a7\u5236\u5757\u4fdd\u5b58\u5934\u6307\u9488\u3001\u5c3e\u6307\u9488\u3001\u5143\u7d20\u8ba1\u6570；\u652f\u6301\u5165\u961f\u3001\u51fa\u961f\u3001\u83b7\u53d6\u961f\u5934\u5143\u7d20\u3001\u6e05\u7a7a\u961f\u5217\u3001\u9500\u6bc1\u961f\u5217\u3002\u4e8c\u53c9\u6811\u5c42\u5e8f\u904d\u5386\u4f9d\u8d56\u8be5\u961f\u5217\u3002<\/p>\n

    #include "queue.h"
    \n#include <stdio.h>
    \n#include <stdlib.h>
    \n\/*************************************************
    \n * \u529f\u80fd：\u521b\u5efa\u94fe\u5f0f\u961f\u5217\u63a7\u5236\u5757，\u521d\u59cb\u5316\u5934\u5c3e\u6307\u9488\u3001\u5143\u7d20\u8ba1\u6570
    \n * \u53c2\u6570：\u65e0
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：\u961f\u5217\u63a7\u5236\u5757\u6307\u9488
    \n *\u5931\u8d25：NULL(malloc\u5931\u8d25)
    \n * ***********************************************\/
    \nQueue *create_queue()
    \n{
    \nQueue *pque = malloc(sizeof(Queue));
    \nif (NULL == pque)
    \n{
    \nprintf("fail malloc\\\\n");
    \nreturn NULL;
    \n}
    \npque->phead = NULL;
    \npque->ptail = NULL;
    \npque->clen = 0;
    \nreturn pque;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u5224\u65ad\u961f\u5217\u662f\u5426\u4e3a\u7a7a
    \n * \u53c2\u6570：
    \n *pque：\u961f\u5217\u63a7\u5236\u5757\u6307\u9488
    \n * \u8fd4\u56de\u503c：
    \n *\u961f\u5217\u4e3a\u7a7a：1
    \n *\u961f\u5217\u975e\u7a7a：0
    \n * ***********************************************\/
    \nint is_empty_queue(Queue *pque)
    \n{
    \nreturn NULL == pque->phead;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u5165\u961f\u64cd\u4f5c，\u5728\u961f\u5c3e\u65b0\u589e\u8282\u70b9
    \n * \u53c2\u6570：
    \n *pque：\u961f\u5217\u63a7\u5236\u5757\u6307\u9488
    \n *data：\u5f85\u5165\u961f\u6570\u636e
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：0
    \n *\u5931\u8d25：-1(\u961f\u5217\u6307\u9488\u4e3a\u7a7a \/ malloc\u5931\u8d25)
    \n * ***********************************************\/
    \nint push_queue(Queue *pque, Data_Type data)
    \n{
    \nif (NULL == pque)
    \nreturn -1;<\/p>\n

    Que_Node *pnode = malloc(sizeof(Que_Node));
    \nif (NULL == pnode)
    \n{
    \nprintf("fail malloc\\\\n");
    \nreturn -1;
    \n}
    \npnode->data = data;
    \npnode->pnext = NULL;
    \nif (is_empty_queue(pque))
    \n{
    \npque->phead = pnode;
    \npque->ptail = pnode;
    \n}
    \nelse
    \n{
    \npque->ptail->pnext = pnode;
    \npque->ptail = pnode;
    \n}
    \npque->clen++;
    \nreturn 0;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u51fa\u961f\u64cd\u4f5c，\u5220\u9664\u961f\u5934\u8282\u70b9
    \n * \u53c2\u6570：
    \n *pque：\u961f\u5217\u63a7\u5236\u5757\u6307\u9488
    \n *pdata：\u8f93\u51fa\u53c2\u6570，\u4fdd\u5b58\u51fa\u961f\u6570\u636e，\u53ef\u4ee5\u4f20\u5165NULL\u4e0d\u9700\u8981\u63a5\u6536\u6570\u636e
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：0
    \n *\u5931\u8d25：-1(\u961f\u5217\u4e3a\u7a7a \/ \u961f\u5217\u6307\u9488\u4e3a\u7a7a)
    \n * ***********************************************\/
    \nint pop_queue(Queue *pque, Data_Type *pdata)
    \n{
    \nif (NULL == pque)
    \nreturn -1;<\/p>\n

    if (is_empty_queue(pque))
    \nreturn -1;<\/p>\n

    Que_Node *pdel = pque->phead;
    \npque->phead = pdel->pnext;
    \nif (NULL == pque->phead)
    \n{
    \npque->ptail = NULL;
    \n}
    \nif (pdata != NULL)
    \n{
    \n*pdata = pdel->data;
    \n}
    \nfree(pdel);
    \npque->clen–;
    \nreturn 0;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u6e05\u7a7a\u961f\u5217\u6240\u6709\u4e1a\u52a1\u8282\u70b9，\u4e0d\u9500\u6bc1\u961f\u5217\u63a7\u5236\u5757
    \n * \u53c2\u6570：
    \n *pque：\u961f\u5217\u63a7\u5236\u5757\u6307\u9488
    \n * \u8fd4\u56de\u503c：\u65e0
    \n * ***********************************************\/
    \nvoid clear_queue(Queue *pque)
    \n{
    \nif (NULL == pque)
    \nreturn ;<\/p>\n

    while (!is_empty_queue(pque))
    \npop_queue(pque, NULL);
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u83b7\u53d6\u961f\u5934\u5143\u7d20，\u4e0d\u5220\u9664\u8282\u70b9
    \n * \u53c2\u6570：
    \n *pque：\u961f\u5217\u63a7\u5236\u5757\u6307\u9488
    \n *pdata：\u8f93\u51fa\u53c2\u6570，\u63a5\u6536\u961f\u5934\u6570\u636e
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：0
    \n *\u5931\u8d25：-1(\u961f\u5217\u4e3a\u7a7a \/ \u961f\u5217\u6307\u9488\u4e3a\u7a7a)
    \n * ***********************************************\/
    \nint get_queue_head(Queue *pque, Data_Type *pdata)
    \n{<\/p>\n

    if (NULL == pque)
    \nreturn -1;
    \nif (is_empty_queue(pque))
    \nreturn -1;<\/p>\n

    if (pdata != NULL)
    \n{
    \n*pdata = pque->phead->data;
    \n}
    \nreturn 0;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u9500\u6bc1\u6574\u4e2a\u961f\u5217，\u91ca\u653e\u5168\u90e8\u4e1a\u52a1\u8282\u70b9+\u961f\u5217\u63a7\u5236\u5757\u5185\u5b58
    \n * \u53c2\u6570：
    \n *pque：\u961f\u5217\u63a7\u5236\u5757\u6307\u9488
    \n * \u8fd4\u56de\u503c：\u65e0
    \n * ***********************************************\/
    \nvoid destroy_queue(Queue *pque)
    \n{
    \nif (NULL == pque)
    \nreturn;
    \nclear_queue(pque);
    \nfree(pque);
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u904d\u5386\u6253\u5370\u961f\u5217\u5168\u90e8\u5143\u7d20
    \n * \u53c2\u6570：
    \n *pque：\u961f\u5217\u63a7\u5236\u5757\u6307\u9488
    \n * \u8fd4\u56de\u503c：\u65e0
    \n * ***********************************************\/
    \nvoid queue_for_each(Queue *pque)
    \n{
    \nif (NULL == pque)
    \nreturn ;<\/p>\n

    Que_Node *p = pque->phead;
    \nwhile (p)
    \n{
    \nprintf("%d ", p->data);
    \np = p->pnext;
    \n}
    \nprintf("\\\\n");
    \n}<\/p>\n

    3\u3001stack.c \u94fe\u5f0f\u6808<\/h3>\n

    \u529f\u80fd\u6982\u8ff0：\u94fe\u5f0f\u6808，\u9075\u5faa\u540e\u8fdb\u5148\u51fa LIFO；\u6240\u6709\u64cd\u4f5c\u90fd\u5728\u6808\u9876\u5b8c\u6210\u3002\u652f\u6301\u5165\u6808\u3001\u51fa\u6808\u3001\u83b7\u53d6\u6808\u9876\u3001\u6e05\u7a7a\u6808\u3001\u9500\u6bc1\u6808\u3002<\/p>\n

    #include "stack.h"
    \n#include <stdio.h>
    \n#include <stdlib.h>
    \n\/*************************************************
    \n * \u529f\u80fd：\u521b\u5efa\u94fe\u5f0f\u6808\u63a7\u5236\u5757，\u521d\u59cb\u5316\u6808\u9876\u6307\u9488\u3001\u5143\u7d20\u8ba1\u6570
    \n * \u53c2\u6570：\u65e0
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：\u6808\u63a7\u5236\u5757\u6307\u9488
    \n *\u5931\u8d25：NULL(malloc\u5931\u8d25)
    \n * ***********************************************\/
    \nStack *create_stack()
    \n{
    \nStack *pstack = malloc(sizeof(Stack));
    \nif (NULL == pstack)
    \n{
    \nprintf("fail malloc");
    \nreturn NULL;
    \n}
    \npstack->ptop = NULL;
    \npstack->clen= 0;
    \nreturn pstack;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u5165\u6808，\u6808\u9876\u4f4d\u7f6e\u63d2\u5165\u65b0\u8282\u70b9
    \n * \u53c2\u6570：
    \n *pstack：\u6808\u63a7\u5236\u5757\u6307\u9488
    \n *data：\u5f85\u5165\u6808\u4e1a\u52a1\u6570\u636e
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：0
    \n *\u5931\u8d25：-1(\u6808\u6307\u9488\u4e3a\u7a7a \/ malloc\u5931\u8d25)
    \n * ***********************************************\/
    \nint push_stack(Stack *pstack, Data_Type data)
    \n{
    \nif (NULL == pstack)
    \n{
    \nprintf("pstack is null\\\\n");
    \nreturn -1;
    \n}<\/p>\n

    Stack_Node *pnode = malloc(sizeof(Stack_Node));
    \nif (NULL == pnode)
    \n{
    \nprintf("malloc fail\\\\n");
    \nreturn -1;
    \n}
    \npnode->data = data;
    \npnode->pnext = pstack->ptop;
    \npstack->ptop = pnode;
    \npstack->clen++;
    \nreturn 0;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u904d\u5386\u6253\u5370\u6808，\u4ece\u6808\u9876\u5411\u6808\u5e95\u8f93\u51fa
    \n * \u53c2\u6570：
    \n *pstack：\u6808\u63a7\u5236\u5757\u6307\u9488
    \n * \u8fd4\u56de\u503c：\u65e0
    \n * ***********************************************\/
    \nvoid stack_for_each(Stack *pstack)
    \n{
    \nif (NULL == pstack)
    \n{
    \nprintf("pstack is null\\\\n");
    \nreturn ;
    \n}
    \nStack_Node *p = pstack->ptop;
    \nwhile (p != NULL)
    \n{
    \nprintf("%d ", p->data);
    \np = p->pnext;
    \n}
    \nprintf("\\\\n");
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u5224\u65ad\u6808\u662f\u5426\u4e3a\u7a7a
    \n * \u53c2\u6570：
    \n *pstack：\u6808\u63a7\u5236\u5757\u6307\u9488
    \n * \u8fd4\u56de\u503c：
    \n *\u6808\u4e3a\u7a7a：1
    \n *\u6808\u975e\u7a7a：0
    \n * ***********************************************\/
    \nint is_empty_stack(Stack *pstack)
    \n{
    \nreturn NULL == pstack->ptop;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u51fa\u6808，\u5220\u9664\u6808\u9876\u8282\u70b9
    \n * \u53c2\u6570：
    \n *pstack：\u6808\u63a7\u5236\u5757\u6307\u9488
    \n *pdata：\u8f93\u51fa\u53c2\u6570，\u63a5\u6536\u51fa\u6808\u6570\u636e，\u53ef\u4ee5\u4f20NULL
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：0
    \n *\u5931\u8d25：-1(\u6808\u7a7a \/ \u6808\u6307\u9488\u4e3a\u7a7a)
    \n * ***********************************************\/
    \nint pop_stack(Stack *pstack, Data_Type *pdata)
    \n{
    \nif (NULL == pstack)
    \n{
    \nprintf("pstack is null\\\\n");
    \nreturn -1;
    \n}<\/p>\n

    if (is_empty_stack(pstack))
    \nreturn -1;
    \nStack_Node *pdel = pstack->ptop;
    \npstack->ptop = pdel->pnext;
    \nif (pdata != NULL)
    \n{
    \n*pdata = pdel->data;
    \n}
    \nfree(pdel);
    \npstack->clen–;
    \nreturn 0;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u83b7\u53d6\u6808\u9876\u6570\u636e，\u4e0d\u5f39\u51fa\u8282\u70b9
    \n * \u53c2\u6570：
    \n *pstack：\u6808\u63a7\u5236\u5757\u6307\u9488
    \n *pdata：\u8f93\u51fa\u53c2\u6570，\u63a5\u6536\u6808\u9876\u6570\u636e
    \n * \u8fd4\u56de\u503c：
    \n *\u6210\u529f：0
    \n *\u5931\u8d25：-1(\u6808\u7a7a \/ \u6808\u6307\u9488\u4e3a\u7a7a)
    \n * ***********************************************\/
    \nint get_stack_top(Stack *pstack, Data_Type *pdata)
    \n{
    \nif (NULL == pstack)
    \n{
    \nprintf("pstack is null\\\\n");
    \nreturn -1;
    \n}
    \nif (is_empty_stack(pstack))
    \nreturn -1;
    \nif (pdata != NULL)
    \n{
    \n*pdata = pstack->ptop->data;
    \n}
    \nreturn 0;
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u6e05\u7a7a\u6808\u6240\u6709\u4e1a\u52a1\u8282\u70b9，\u4e0d\u9500\u6bc1\u6808\u63a7\u5236\u5757
    \n * \u53c2\u6570：
    \n *pstack：\u6808\u63a7\u5236\u5757\u6307\u9488
    \n * \u8fd4\u56de\u503c：\u65e0
    \n * ***********************************************\/
    \nvoid clear_stack(Stack *pstack)
    \n{
    \nif (NULL == pstack)
    \n{
    \nprintf("pstack is null\\\\n");
    \nreturn ;
    \n}
    \nwhile (!is_empty_stack(pstack))
    \npop_stack(pstack, NULL);
    \n}
    \n\/*************************************************
    \n * \u529f\u80fd：\u9500\u6bc1\u6574\u4e2a\u6808，\u91ca\u653e\u4e1a\u52a1\u8282\u70b9+\u6808\u63a7\u5236\u5757
    \n * \u53c2\u6570：
    \n *pstack：\u6808\u63a7\u5236\u5757\u6307\u9488
    \n * \u8fd4\u56de\u503c：\u65e0
    \n * ***********************************************\/
    \nvoid destroy_stack(Stack *pstack)
    \n{
    \nif (NULL == pstack)
    \n{
    \nprintf("pstack is null\\\\n");
    \nreturn ;
    \n}
    \nclear_stack(pstack);
    \nfree(pstack);
    \n}<\/p>\n

    4\u3001doulink.h \u5e26\u5934\u53cc\u5411\u94fe\u8868\u5934\u6587\u4ef6<\/h3>\n

    \u529f\u80fd\u6982\u8ff0：\u5e26\u5934\u53cc\u5411\u94fe\u8868，\u6bcf\u4e2a\u8282\u70b9\u62e5\u6709\u524d\u9a71ppre\u3001\u540e\u7ee7pnext\u6307\u9488；\u5934\u6587\u4ef6\u53ea\u653e\u7ed3\u6784\u4f53\u5b9a\u4e49\u4e0e\u51fd\u6570\u58f0\u660e\u3002<\/p>\n

    #ifndef __DOULINK_H__
    \n#define __DOULINK_H__
    \n\/\/\u53cc\u5411\u94fe\u8868\u5b58\u50a8\u4e1a\u52a1\u6570\u636e\u7ed3\u6784\u4f53
    \ntypedef struct stu
    \n{
    \nint id;
    \nchar name[32];
    \nint score;
    \n}Data_Type;
    \n\/\/\u53cc\u5411\u94fe\u8868\u7ed3\u70b9\u7c7b\u578b
    \ntypedef struct node
    \n{
    \nData_Type data; \/\/\u6570\u636e\u57df
    \nstruct node *ppre; \/\/\u524d\u9a71\u6307\u9488\u57df
    \nstruct node *pnext; \/\/\u540e\u7ee7\u6307\u9488\u57df
    \n}Dou_Node;<\/p>\n

    \/**
    \n * @brief \u521b\u5efa\u6709\u5934\u53cc\u5411\u94fe\u8868\u5934\u8282\u70b9
    \n * @return \u6210\u529f\u8fd4\u56de\u5934\u8282\u70b9\u6307\u9488；\u5931\u8d25\u8fd4\u56deNULL
    \n *\/
    \nextern Dou_Node *create_doulink();<\/p>\n

    \/**
    \n * @brief \u53cc\u5411\u94fe\u8868\u5934\u90e8\u63d2\u5165\u8282\u70b9
    \n * @param phead \u53cc\u5411\u94fe\u8868\u54e8\u5175\u5934\u8282\u70b9
    \n * @param data \u5f85\u63d2\u5165\u4e1a\u52a1\u6570\u636e
    \n * @return \u6210\u529f0，\u5931\u8d25-1
    \n *\/
    \nextern int insert_head_doulink(Dou_Node *phead, Data_Type data);<\/p>\n

    \/**
    \n * @brief \u53cc\u5411\u94fe\u8868\u904d\u5386，dir\u63a7\u5236\u6b63\u5411\/\u53cd\u5411\u904d\u5386
    \n * @param phead \u53cc\u5411\u94fe\u8868\u54e8\u5175\u5934\u8282\u70b9
    \n * @param dir \u904d\u5386\u65b9\u5411\u6807\u8bc6
    \n * @return \u65e0\u8fd4\u56de\u503c
    \n *\/
    \nextern void doulink_for_each(Dou_Node*phead, int dir);<\/p>\n

    \/**
    \n * @brief \u53cc\u5411\u94fe\u8868\u5c3e\u90e8\u63d2\u5165\u8282\u70b9
    \n * @param phead \u53cc\u5411\u94fe\u8868\u54e8\u5175\u5934\u8282\u70b9
    \n * @param data \u5f85\u63d2\u5165\u4e1a\u52a1\u6570\u636e
    \n * @return \u6210\u529f0，\u5931\u8d25-1
    \n *\/
    \nextern int insert_tail_doulink(Dou_Node *phead, Data_Type data);<\/p>\n

    \/**
    \n * @brief \u5220\u9664\u53cc\u5411\u94fe\u8868\u5934\u90e8\u6709\u6548\u8282\u70b9
    \n * @param phead \u53cc\u5411\u94fe\u8868\u54e8\u5175\u5934\u8282\u70b9
    \n * @return \u6210\u529f0，\u5931\u8d25-1
    \n *\/
    \nextern int delete_head_doulink(Dou_Node *phead);<\/p>\n

    \/**
    \n * @brief \u5220\u9664\u53cc\u5411\u94fe\u8868\u5c3e\u90e8\u6709\u6548\u8282\u70b9
    \n * @param phead \u53cc\u5411\u94fe\u8868\u54e8\u5175\u5934\u8282\u70b9
    \n * @return \u6210\u529f0，\u5931\u8d25-1
    \n *\/
    \nextern int delete_tail_doulink(Dou_Node *phead);<\/p>\n

    \/**
    \n * @brief \u6839\u636e\u540d\u5b57\u67e5\u627e\u53cc\u5411\u94fe\u8868\u8282\u70b9
    \n * @param phead \u53cc\u5411\u94fe\u8868\u54e8\u5175\u5934\u8282\u70b9
    \n * @param name \u5f85\u67e5\u627e\u540d\u5b57\u5b57\u7b26\u4e32
    \n * @return \u627e\u5230\u8fd4\u56de\u8282\u70b9\u6307\u9488；\u627e\u4e0d\u5230\u8fd4\u56deNULL
    \n *\/
    \nextern Dou_Node *find_doulink(Dou_Node *phead, char *name);<\/p>\n

    \/**
    \n * @brief \u9500\u6bc1\u53cc\u5411\u94fe\u8868\u5168\u90e8\u8282\u70b9\u5185\u5b58
    \n * @param phead \u53cc\u5411\u94fe\u8868\u54e8\u5175\u5934\u8282\u70b9
    \n * @return \u65e0\u8fd4\u56de\u503c
    \n *\/
    \nextern void destroy_doulink(Dou_Node *phead);
    \n#endif<\/p>\n

    5\u3001hash.c \u62c9\u94fe\u6cd5\u54c8\u5e0c\u8868<\/h3>\n

    \u529f\u80fd\u6982\u8ff0：\u91c7\u7528\u62c9\u94fe\u6cd5\u89e3\u51b3\u54c8\u5e0c\u51b2\u7a81；\u54c8\u5e0c\u51fd\u6570\u53d6\u540d\u5b57\u9996\u5b57\u6bcd\u6620\u5c04\u6570\u7ec4\u4e0b\u6807；\u94fe\u8868\u5934\u63d2\u6cd5\u63d2\u5165\u5143\u7d20；\u5b9e\u73b0\u63d2\u5165\u3001\u904d\u5386\u3001\u67e5\u627e\u3001\u9500\u6bc1\u54c8\u5e0c\u8868\u3002<\/p>\n

    #include "hash.h"
    \n#include <stdio.h>
    \n#include <stdlib.h>
    \n#include <string.h>
    \n\/*************************************************
    \n * @brief \u54c8\u5e0c\u6620\u5c04\u51fd\u6570，\u5b57\u7b26\u8f6c\u6362\u54c8\u5e0c\u8868\u6570\u7ec4\u4e0b\u6807
    \n * @param key \u8f93\u5165\u5b57\u7b26，\u4e00\u822c\u53d6\u59d3\u540d\u9996\u5b57\u6bcd
    \n * @return \u54c8\u5e0c\u6570\u7ec4\u4e0b\u6807
    \n * @note \u5927\u5c0f\u5199a\u2011z\/A\u2011Z\u6620\u5c040\u201125；\u5176\u4ed6\u5b57\u7b26\u6620\u5c04\u54c8\u5e0c\u8868\u6700\u540e\u4e00\u4e2a\u4f4d\u7f6e
    \n * ***********************************************\/
    \nint hash_function(char key)
    \n{
    \nif (key >= 'a' && key <= 'z')
    \n{
    \nreturn key-'a';
    \n}
    \nelse if (key >= 'A' && key <= 'Z')
    \n{
    \nreturn key-'A';
    \n}
    \nelse
    \n{
    \nreturn HASH_MAX_SIZE-1;
    \n}
    \n}
    \n\/*************************************************
    \n * @brief \u62c9\u94fe\u54c8\u5e0c\u8868\u5934\u63d2\u6cd5\u63d2\u5165\u4e00\u6761\u6570\u636e
    \n * @param hash_table \u54c8\u5e0c\u8868\u6307\u9488\u6570\u7ec4
    \n * @param data \u5f85\u63d2\u5165\u4e1a\u52a1\u6570\u636e
    \n * @return \u6210\u529f0；\u5931\u8d25\u20111(malloc\u5931\u8d25)
    \n * ***********************************************\/
    \nint insert_hash_table(Hash_Node **hash_table, Data_Type data)
    \n{
    \nint addr = hash_function(data.name[0]);
    \nHash_Node *pnode = malloc(sizeof(Hash_Node));
    \nif (NULL == pnode)
    \n{
    \nprintf("fail malloc\\\\n");
    \nreturn -1;
    \n}
    \npnode->data = data;
    \npnode->pnext = NULL;<\/p>\n

    pnode->pnext = hash_table[addr];
    \nhash_table[addr] = pnode;
    \nreturn 0;
    \n}
    \n\/*************************************************
    \n * @brief \u5b8c\u6574\u904d\u5386\u54c8\u5e0c\u8868\u8f93\u51fa\u5168\u90e8\u5b58\u50a8\u5143\u7d20
    \n * @param hash_table \u54c8\u5e0c\u8868\u6307\u9488\u6570\u7ec4
    \n * @return \u65e0\u8fd4\u56de\u503c
    \n * ***********************************************\/
    \nvoid hash_for_each(Hash_Node **hash_table)
    \n{
    \nHash_Node *p = NULL;
    \nfor (int i = 0; i < HASH_MAX_SIZE; i++)
    \n{
    \np = hash_table[i];
    \nwhile (p)
    \n{
    \nprintf("%s:%s\\\\n", p->data.name, p->data.tel);
    \np = p->pnext;
    \n}
    \nprintf("\\\\n");
    \n}
    \n}
    \n\/*************************************************
    \n * @brief \u6839\u636e\u59d3\u540d\u67e5\u627e\u54c8\u5e0c\u8868\u5143\u7d20\u5e76\u6253\u5370\u5339\u914d\u7ed3\u679c
    \n * @param hash_table \u54c8\u5e0c\u8868\u6307\u9488\u6570\u7ec4
    \n * @param name \u5f85\u67e5\u627e\u59d3\u540d
    \n * @return \u56fa\u5b9a\u8fd4\u56de0
    \n * ***********************************************\/
    \nint find_hash_table(Hash_Node **hash_table, char *name)
    \n{
    \nint addr = hash_function(name[0]);<\/p>\n

    Hash_Node *p = hash_table[addr];
    \nwhile (p)
    \n{
    \nif (0 == strncmp(p->data.name, name, strlen(name)))
    \n{
    \nprintf("%s:%s\\\\n", p->data.name, p->data.tel);
    \n}
    \np = p->pnext;
    \n}
    \nreturn 0;
    \n}
    \n\/*************************************************
    \n * @brief \u9500\u6bc1\u54c8\u5e0c\u8868\u6240\u6709\u94fe\u8868\u8282\u70b9\u5185\u5b58
    \n * @param hash_table \u54c8\u5e0c\u8868\u6307\u9488\u6570\u7ec4
    \n * @return \u65e0\u8fd4\u56de\u503c
    \n * ***********************************************\/
    \nvoid destroy_hash_table(Hash_Node **hash_table)
    \n{
    \nHash_Node *pdel = NULL;
    \nfor (int i = 0; i < HASH_MAX_SIZE; i++)
    \n{
    \nwhile (hash_table[i] != NULL)
    \n{
    \npdel = hash_table[i];
    \nhash_table[i] = pdel -> pnext;
    \nfree(pdel);
    \n}
    \n}
    \n}<\/p>\n

    6\u3001tree.c \u4e8c\u53c9\u6811<\/h3>\n

    \u529f\u80fd\u6982\u8ff0：\u4e8c\u53c9\u6811，\u4f7f\u7528\u5148\u5e8f\u5e8f\u5217\u5316\u5b57\u7b26\u4e32（#\u4ee3\u8868\u7a7a\u8282\u70b9）\u9012\u5f52\u6784\u5efa\u4e8c\u53c9\u6811；\u5b9e\u73b0\u5148\u5e8f\u3001\u4e2d\u5e8f\u3001\u540e\u5e8f\u9012\u5f52\u904d\u5386；\u7edf\u8ba1\u8282\u70b9\u603b\u6570\u3001\u6c42\u6811\u6df1\u5ea6；\u961f\u5217\u5b9e\u73b0\u5c42\u5e8f（\u5e7f\u5ea6）\u904d\u5386；\u540e\u5e8f\u9012\u5f52\u9500\u6bc1\u6574\u68f5\u6811\u3002<\/p>\n

    #include "tree.h"
    \n#include <stdio.h>
    \n#include <stdlib.h>
    \n#include "queue.h"
    \n\/\/\u4e8c\u53c9\u6811\u5148\u5e8f\u5e8f\u5217\u5316\u5b57\u7b26\u4e32，#\u4ee3\u8868\u7a7a\u8282\u70b9
    \nchar tree[] = "ABE#C##FM###DG##HI###";
    \nint idx = 0;
    \n\/*************************************************
    \n * @brief \u6839\u636e\u5148\u5e8f\u5e8f\u5217\u5316\u5b57\u7b26\u4e32\u9012\u5f52\u521b\u5efa\u4e8c\u53c9\u6811
    \n * @return \u6811\u6839\u8282\u70b9\u6307\u9488；\u5931\u8d25\u8fd4\u56deNULL
    \n * @note \u5168\u5c40\u53d8\u91cftree\u8bfb\u53d6\u5b57\u7b26\u4e32；idx\u8bb0\u5f55\u5f53\u524d\u8bfb\u53d6\u4f4d\u7f6e；#\u4ee3\u8868\u7a7a\u8282\u70b9\u8fd4\u56deNULL
    \n * ***********************************************\/
    \nTree_Node *create_bin_tree()
    \n{
    \nBTData_Type mydata = tree[idx++];
    \nif ('#' == mydata)
    \n{
    \nreturn NULL;
    \n}
    \nTree_Node *pnode = malloc(sizeof(Tree_Node));
    \nif (NULL == pnode)
    \n{
    \nprintf("fail malloc\\\\n");
    \nreturn NULL;
    \n}
    \npnode->data = mydata;
    \npnode->pl = create_bin_tree();
    \npnode->pr = create_bin_tree();
    \nreturn pnode;
    \n}
    \n\/*************************************************
    \n * @brief \u4e8c\u53c9\u6811\u5148\u5e8f\u904d\u5386：\u6839 \u2192 \u5de6\u5b50\u6811 \u2192 \u53f3\u5b50\u6811
    \n * @param proot \u4e8c\u53c9\u6811\u6839\u8282\u70b9\u6307\u9488
    \n * @return \u65e0\u8fd4\u56de\u503c
    \n * ***********************************************\/
    \nvoid pre_order(Tree_Node *proot)
    \n{
    \nif (NULL == proot)
    \nreturn ;
    \nprintf("%c", proot->data);
    \npre_order(proot->pl);
    \npre_order(proot->pr);
    \n}
    \n\/*************************************************
    \n * @brief \u4e8c\u53c9\u6811\u4e2d\u5e8f\u904d\u5386：\u5de6\u5b50\u6811 \u2192 \u6839 \u2192 \u53f3\u5b50\u6811
    \n * @param proot \u4e8c\u53c9\u6811\u6839\u8282\u70b9\u6307\u9488
    \n * @return \u65e0\u8fd4\u56de\u503c
    \n * ***********************************************\/
    \nvoid mid_order(Tree_Node *proot)
    \n{
    \nif (NULL == proot)
    \nreturn ;
    \nmid_order(proot->pl);
    \nprintf("%c", proot->data);
    \nmid_order(proot->pr);
    \n}
    \n\/*************************************************
    \n * @brief \u4e8c\u53c9\u6811\u540e\u5e8f\u904d\u5386：\u5de6\u5b50\u6811 \u2192 \u53f3\u5b50\u6811 \u2192 \u6839
    \n * @param proot \u4e8c\u53c9\u6811\u6839\u8282\u70b9\u6307\u9488
    \n * @return \u65e0\u8fd4\u56de\u503c
    \n * ***********************************************\/
    \nvoid pos_order(Tree_Node *proot)
    \n{
    \nif (NULL == proot)
    \nreturn;
    \npos_order(proot->pl);
    \npos_order(proot->pr);
    \nprintf("%c", proot->data);
    \n}
    \n\/*************************************************
    \n * @brief \u7edf\u8ba1\u4e8c\u53c9\u6811\u603b\u8282\u70b9\u6570\u91cf
    \n * @param proot \u4e8c\u53c9\u6811\u6839\u8282\u70b9\u6307\u9488
    \n * @return \u8282\u70b9\u4e2a\u6570；\u7a7a\u6811\u8fd4\u56de0
    \n * ***********************************************\/
    \nint get_tree_node_cnt(Tree_Node *proot)
    \n{
    \nif (NULL == proot)
    \nreturn 0;
    \nreturn 1+get_tree_node_cnt(proot->pl)+get_tree_node_cnt(proot->pr);
    \n}
    \n\/*************************************************
    \n * @brief \u83b7\u53d6\u4e8c\u53c9\u6811\u6df1\u5ea6（\u6811\u5c42\u6570）
    \n * @param proot \u4e8c\u53c9\u6811\u6839\u8282\u70b9\u6307\u9488
    \n * @return \u6811\u6df1\u5ea6；\u7a7a\u6811\u8fd4\u56de0
    \n * ***********************************************\/
    \nint get_tree_layer_cnt(Tree_Node *proot)
    \n{
    \nif (NULL == proot)
    \nreturn 0;
    \nint cntl = get_tree_layer_cnt(proot->pl);
    \nint cntr = get_tree_layer_cnt(proot->pr);<\/p>\n

    return cntl > cntr ? cntl+1 : cntr+1;
    \n}
    \n\/*************************************************
    \n * @brief \u540e\u5e8f\u9012\u5f52\u9500\u6bc1\u4e8c\u53c9\u6811\u6240\u6709\u8282\u70b9\u5185\u5b58
    \n * @param proot \u4e8c\u53c9\u6811\u6839\u8282\u70b9\u6307\u9488
    \n * @return \u65e0\u8fd4\u56de\u503c
    \n * ***********************************************\/
    \nvoid destroy_tree(Tree_Node *proot)
    \n{
    \nif (NULL == proot)
    \nreturn;
    \ndestroy_tree(proot->pl);
    \ndestroy_tree(proot->pr);
    \nfree(proot);
    \n}
    \n\/*************************************************
    \n * @brief \u4e8c\u53c9\u6811\u5c42\u5e8f\u904d\u5386（\u5e7f\u5ea6\u4f18\u5148BFS），\u4f9d\u8d56\u961f\u5217\u5b9e\u73b0
    \n * @param proot \u4e8c\u53c9\u6811\u6839\u8282\u70b9\u6307\u9488
    \n * @return \u65e0\u8fd4\u56de\u503c
    \n * ***********************************************\/
    \nvoid layer_order(Tree_Node *proot)
    \n{
    \nif (NULL == proot)
    \nreturn;<\/p>\n

    Queue *pque = create_queue();
    \nif (NULL == pque)
    \nreturn;
    \nData_Type outdata;
    \npush_queue(pque, proot);
    \nwhile (!is_empty_queue(pque))
    \n{
    \npop_queue(pque, &outdata);
    \nprintf("%c",outdata->data);
    \nif (outdata->pl != NULL)
    \n{
    \npush_queue(pque, outdata->pl);
    \n}
    \nif (outdata->pr != NULL)
    \n{
    \npush_queue(pque, outdata->pr);
    \n}<\/p>\n

    }
    \ndestroy_queue(pque);
    \n}<\/p>\n

    📝\u77e5\u8bc6\u70b9\u603b\u7ed3<\/h2>\n

    \u4e00\u3001\u5355\u5411\u94fe\u8868 link.c<\/h3>\n