队列的链式实现

 

#include<iostream>
using namespace std;

typedef int Elemtype;
typedef struct LinkNode
{
Elemtype data;
struct LinkNode* next;
}linkNode;
typedef struct
{
LinkNode* front, * rear;
}LinkQueue;
void initLinkQueue(LinkQueue& Q);
bool IsEmptyQueue(LinkQueue& Q);
void InLinkQueue(LinkQueue& Q, Elemtype x);
bool OutLinkQueue(LinkQueue& Q, Elemtype& x);
bool printQueue(LinkQueue& Q);
int main()
{
LinkQueue Q;
initLinkQueue( Q);
IsEmptyQueue(Q);
Elemtype x;
InLinkQueue(Q, 1);
InLinkQueue(Q, 2);
InLinkQueue(Q, 3);
InLinkQueue(Q, 4);
printQueue(Q);
OutLinkQueue(Q, x);
printQueue(Q);
system("pause");
return 0;
}
//初始化队列
void initLinkQueue(LinkQueue& Q)
{
Q.front = Q.rear = new LinkNode;
Q.front->next = NULL;

}
//判空
bool IsEmptyQueue(LinkQueue& Q)
{
if (Q.front == Q.rear)
return true;
else
return false;
}
//入队
void InLinkQueue(LinkQueue& Q, Elemtype x)
{
LinkNode* n = new LinkNode;
n->data = x;
n->next = NULL;
Q.rear->next = n;
Q.rear = n;
}
//出队
bool OutLinkQueue(LinkQueue& Q, Elemtype& x)
{
if (Q.rear == Q.front)
return false;
LinkNode* p = Q.front->next;
x = p->data;
Q.front->next = p->next;
if (Q.rear == p)
Q.rear = Q.front;
delete p;
p = NULL;
return true;
}
bool printQueue(LinkQueue& Q)
{
if (Q.front == Q.rear)
{
cout << "队列为空 " << endl;
return false;
}
LinkNode* p = Q.front->next;
while (p)
{
cout << p->data << " ";
p = p->next;
}
cout << endl;
return true;
}