1. /*
    2.     此文件用于创建一个链式队列
    3.     分析：
    4.         我们需要创建一个链表，然后设置front、rear指针，用来模拟入队出队的过程
    5. */
    6. //#define TYPE biTree* 
    7. #define TYPE char
    8. //#define TYPE int
    9. struct biTree {//新增树节点
    10.     char data;
    11.     struct biTree *lchild;
    12.     struct biTree *rchild;
    14. };
    15. struct Link {
    16.     //TYPE data;
    17.     TYPE node;
    18.     struct Link *next;
    19. };
    20. struct LinkQueue {
    21.     struct Link *front, *rear;
    22. };
    23. #include <stdio.h>
    24. #include <stdlib.h>
    26. //创建一个空链表
    27. Link* createLink() {
    28.     int n, data;
    29.     char letter;
    30.     struct Link *q;
    31.     struct Link *head = (struct Link*) malloc(sizeof(struct Link));
    32.     head->next = NULL;
    33.     q = head;
    34.     return head;
    35. }
    36. //创建链队
    37. LinkQueue *create() {
    38.     struct Link *h,*p;
    39.     struct LinkQueue *lq=(struct LinkQueue *)malloc(sizeof(struct LinkQueue));
    40.     h = createLink();
    41.     p = h->next;
    42.     lq->front = lq->rear = h;
    43.     return lq;
    44. }
    45. //判断空
    46. bool isEmpty(LinkQueue *lq) {
    47.     return lq->front == lq->rear;
    48. }
    49. //入队
    50. bool enQueue(LinkQueue *lq,TYPE data) {//队尾插入
    51.     struct Link *newd = (struct Link *)malloc(sizeof(struct Link));
    52.     newd->node = data;
    53.     lq->rear->next = newd;
    54.     lq->rear = newd;
    55.     lq->rear->next = NULL;
    56.     return true;
    57. }
    58. //出队
    59. bool deQueue(LinkQueue *lq,TYPE *data) {
    60.     if (isEmpty(lq))return false;
    61.     struct Link *p = lq->front->next;//保存下一个节点
    62.     *data = lq->front->next->node;//取出队首节点值
    63.     lq->front->next = p->next;//删除队首节点
    64.     if (lq->rear==p) {
    65.         lq->rear = lq->front;
    66.     }
    67.     free(p);
    68.     return true;
    69. }
    70. //打印队列中元素
    71. void printQ(LinkQueue *lq) {
    72.     Link *p = lq->front->next;
    73.     while (p!=NULL) {
    74.         printf("%c",p->node);
    75.         p = p->next;
    76.     }
    77. };