C語(yǔ)言實(shí)現(xiàn)鏈隊(duì)列

#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
typedef int ElemType;

//鏈隊(duì)列的結(jié)點(diǎn)定義 
typedef struct node{
  ElemType val;
  struct node* next;
}QueueNode;

//鏈隊(duì)列的定義，包含隊(duì)頭指針和隊(duì)尾指針 
typedef struct queue {
  QueueNode* front;
  QueueNode* rear;
}LinkedQueue;

//初始化隊(duì)列 
LinkedQueue* initQueue() {
  LinkedQueue* queue = (LinkedQueue*)malloc(sizeof(LinkedQueue));
  queue->front = (QueueNode*)malloc(sizeof(QueueNode));
  queue->front->next = NULL;
  queue->rear = queue->front;
}

//元素入隊(duì) 
void enQueue(LinkedQueue* queue, ElemType elem) {
  QueueNode* node = (QueueNode*)malloc(sizeof(QueueNode));
  node->val = elem;
  node->next = NULL;
  queue->rear->next = node;
  queue->rear = node;
}

//隊(duì)列是否為空 
bool isQueueEmpty(LinkedQueue* queue) {
  return queue->front == queue->rear; 
}

//元素出隊(duì) 
ElemType deQueue(LinkedQueue* queue) {
  if(!isQueueEmpty(queue)) {
    QueueNode* p = queue->front;
    queue->front = p->next;
    ElemType e = queue->front->val;
    free(p);
    return e;
  }
  return NULL;
}

int main()
{
  LinkedQueue* queue = initQueue();
  int i;
  for(i = 0; i < 20; i++) {
    enQueue(queue, i);
  }
  while(!isQueueEmpty(queue)) {
    printf("deQueue: %d\n", deQueue(queue));
  }
  return 0;
}