数据结构链表队列

// 链表.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"

#include <iostream>
using namespace std;
class student
{
public:
 int num;
 student *next;
};
int n;
student *create(void)
{
  cout<<"创建链表"<<endl;
  student *head;
  student *p1,*p2;
  n=0;
  p1=p2=new student;
  cin>>p1->num;
  head=NULL;
while(p1->num!=0)
{
 n=n+1;
if(n==1)
 head=p1;
else 
 p2->next=p1;
p2=p1;

p1=new student;

cin>>p1->num;
}
p2->next=NULL;
cout<<"链表创建结束"<<endl;
return(head);}
void *print (student *head)
{cout<<"现在开始打印链表"<<endl;
student *p;
p=head;
for(;p!=NULL;)
{cout<<p->num<<endl;
p=p->next;}
return 0;
}
student *chudui(student *head){
	cout<<"现在开始出队"<<endl;
    student *p,*q;
    q=p=head;
	if(p->num==0)
	{	
		cout<<"队列里没有元素。"<<endl;
	} 
	else
	{
		p=p->next;
	    head=p;
		delete q;
	}
	 return(head);
}
int main()
{
 student *head;
 head=create();
 head=chudui(head);
 print(head);
 return 0;
}