#include <stdio.h>
#include<stdlib.h>
//链式队列节点
typedef struct LinkNode {
int data;
struct LinkNode* next;
}LinkNode;
//链式队列
typedef struct {
LinkNode* front, * rear;
}LinkQueue;
//初始化(不带头结点)
void InitQueue(LinkQueue& Q) {
Q.front = Q.rear = NULL;
Q.front->next = NULL;
}
//判空
bool IsEmpty(LinkQueue& Q) {
if (Q.front ==NULL)
return true;
else
return false;
}
//入队
void EnQueue(LinkQueue& Q, int x) {
LinkNode* q = (LinkNode*)malloc(sizeof(LinkNode));
q->data = x;
q->next = NULL;
if (Q.front == NULL) {
Q.front = q;
Q.rear = q;
}
else {
Q.rear->next = q;
Q.rear = q;
}
}
LinkQueue_withoutlinknode
最新推荐文章于 2024-07-09 14:56:12 发布