#include"iostream"
using namespace std;
typedef int ElemType;
typedef struct Qnode
{
ElemType data;
struct node *next;
}Qnode,*QueuePtr;
typedef struct
{
QueuePtr front;
QueuePtr rear;
}LinkQueue;
void InitQueue(LinkQueue &Q)
{
Q.front=Q.rear=(QueuePtr)malloc(sizeof(Qnode));
if(!Q.front)
{
cout<<"初始化失败"<<endl;
}
else
{
cout<<"初始化成功"<<endl;
Q.front->next=NULL;
}
}
void EmptyQueue(LinkQueue Q)
{
if(Q.rear==Q.front)
cout<<"链队列为空"<<endl;
else
cout<<"链队列不为空"<<endl;
}
void EnQueue(LinkQueue &Q)
{
int n;
cout<<"请输入您想入队几位数"<<endl;
for(int i=0;i<n;i++)
{
Qnode *p;
p=new Qnode;
cout<<"请输入您想要入队的元素"<<endl;
cin>>p->data;
p->next=NULL;
Q.rear->next=p;
Q.rear=p;
}
}
int main()
{
LinkQueue Q;
InitQueue(Q);
EmptyQueue(Q);
EnQueue(Q);
return 0;
}