1.队列相关概念
2.队列的抽象数据类型定义
前面已有
3.队列的顺序存储类型定义
不论出队入队指针都是后移
4.循环队列
5.循环队列判断队空队满
只介绍了少用一个空间的方法
6.循环队列的初始化(联系2的类型定义)
Status InitQueue(SqQueue& Q) {
Q.base = new QELemType[MAXQSIZE];
if (!Q.base)exit(OVERFLOW);
Q.front = Q.REAR = 0;
return OK;
}
求队列的长度
//元素出队
Status DeQueue(SqQueue& Q, QElemType& e) {
if (Q.front == Q.rear)return ERROR;
e = Q.base[Q.front];
Q.front = (Q.front + 1) % MAXQSIZE;//保存队头元素
return OK;
}
//取队头元素
SElemType GetHead(SqQuere Q) {
if (Q.front != Q.rear)
return Q.base[Q.front];
}
7.队列的链式表示和实现
链表一个头指针即可,队列需要两个指针
//链队列的类型定义
#define MAXQSIZE 100
typedef struct Qnode {
QElemType data;
struct Qnode* next;
}QNode,*QuenePtr;
typedef struct {
QuenePtr front;//队头指针
QuenePtr rear;//队尾指针
}LinkQuene;
//链队列初始化
Status InitQueue(LinkQueue& Q) {
Q.front = Q.rear = (QueuePtr)malloc(sizeof(QNode));
if (!Q.front)exit(OVERFLOW);//判断溢出
Q.front->next = NULL;
return OK;
}
//链队列销毁
Status DestoryQueue(LinkQueue& Q) {
while (Q.front) {
p = Q.front->next; free(Q.front); Q.front = p;
}
return OK;
}
//元素e入队
Status EnQueeue(LinkQueue& Q, QElemType e) {
p = (QueuePtr)malloc(sizeof(QNode));
if (!p)exit(OVERFLOW);
p->data = e; p->next = NULL;
Q.rear->next = p;
Q.rear = p;
return OK;
}
//元素出队
Status DeQueue(LinkQueue& Q, QElemType& e) {
if (Q.front == Q.rear)return ERROR;
p = Q.front->next;
e = p->data;
Q.front->next = p->next;
if(Q.rear==p)Q.rear=Q.front;//若要删除的是尾结点
delete p;
return OK;
}
//求链队列的队头元素
Status GetHead(LinkQueue Q, QElemType& e) {
if (Q.front == Q.rear)return ERROR;
e = Q.front->next->data;
return OK;
}