队列

//编程实现队列的入队
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <conio.h>
using namespace std;


typedef struct student
{
int data;
struct student *next;


}node;


typedef struct linkqueue
{
node *first,*rear;
}queue;


//队列的入队
queue *insert(queue *HQ,int x)
{
node *s;
s=(node *)malloc(sizeof(node));
s->data=x;
s->next=NULL;//元素的入队


if(HQ->rear == NULL)
{
HQ->first =s;
HQ->rear = s;//rear后面的，指队列的尾巴
}
else
{
HQ->rear->next = s;
HQ->rear = s;
}


return(HQ);
}


//编程实现队列的出队
queue *del(queue*HQ)
{
node *p;
int x;
if(HQ->first == NULL)//队列为空
{
printf("\n yichu");
}
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);
}
}


//编程实现队列的测长


int length(node *HS)
{
int n=0;
node *p;
p=HS;
while (p !=NULL)
{
p=p->next;
n++;
}


return (n);
}
//编程实现打印队列
void print(queue *HQ)
{
node *p;
int n;
p=HQ->first;


while(p!= NULL)
{
printf(" \n uuu  %d ",p->data);
p=p->next;
}
}


int main()
{
node stud;
queue *HQ;
int n,del_num,insert_num;
HQ=(queue*)malloc(sizeof(queue));
HQ=insert(HQ,1);
HQ=insert(HQ,2);
print(HQ);
HQ=del(HQ);
print(HQ);
return 0;
}