队列的入列和出列

#include<iostream>
using namespace std;
typedef struct student
{
int data;
student *next;
}node;


typedef struct linkqueue
{
node* first,*rear;
}queue1;
//队列的入队
queue *insert(queue1 *HQ,int x)
{
node* s = (node*)malloc(sizeof(node));
s->data = x;
s->next = NULL;
if(HQ->rear == NULL)
{
HQ->first = s;
HQ->rear = s
}
else
{
HQ->rear->next = s;
HQ->rear = s;
}
return HQ;
}
//队列的出队
queue *del(queue1 *HQ)
{
node*p;
int x;
if(NULL == HQ->first)
{
cout<<"溢出"<<endl;
}
else
{
x = HQ->first->data;
p = HQ->first;
if(HQ->first == HQ->rear)
{
HQ->first = NULL;
HQ->rear  = NULL;
}
else
{
HQ->first = HQ->first->next;
free(p);
}
return HQ;
}
}