//建一个简单的队列，(对它进行按关键字排序，查找，)增加结点和删除结点
#include<stdio.h>
#include<stdlib.h>
#define LEN sizeof(struct StudentNode)
#define MAXSIZE 6//队列总长度
struct StudentNode
{
 long num;
 float score;
 struct StudentNode * next;
};
int n;//当前队列人数
//创建队列链表
struct StudentNode*creat(void)
{
 struct StudentNode * node1,* node2;
 struct StudentNode * front;//队头
 node1=node2=(struct StudentNode * )malloc(LEN);
 front=NULL;
 n=0;
 scanf("%ld,%f",&node1->num ,&node1->score);
 while(node1->num!=0)//num输入0结束队列
 {
  n=n+1;
  if(n==1)
  {
   front=node1;
  }
  else
  {
   node2->next=node1;
  }
  node2=node1;
  node1=(struct StudentNode * )malloc(LEN);
  scanf("%ld,%f",&node1->num ,&node1->score);
 }
 node1->next=NULL;
 return front;
};
//增加结点（插入一个元素到队尾）
struct StudentNode*Enter(struct StudentNode * node,long num,float score)
{
 if(n==MAXSIZE)//队列已满
 {
  printf("Student Is Full\n");
 }
 struct StudentNode * front;
 front=(struct StudentNode * )malloc(LEN);
 front=node;
    (front+n)->num=num;
 (front+n)->score=score;
 (front+n)->next=NULL;
 n=n+1;
 return front;
};
//删除结点（删除队头的一个元素）
struct StudentNode*Delete(struct StudentNode * node)
{
 if(n==0)//空队列
 {
  printf("Student Is Empty");
 }
 struct StudentNode * front;
 front=(struct StudentNode * )malloc(LEN);
    front=node;
 node=node->next;
 return node;
}
//显示链表1
void print1(struct StudentNode * p)
{
 struct StudentNode * Node;
 Node=p;
 if(Node!=NULL)
  do
  {
   printf("\nnum:%ld\nscore:%5.1f\n",Node->num,Node->score);
            Node=Node->next;
  }while(Node!=NULL);
}
//显示链表2
void print2(struct StudentNode * p)
{
 struct StudentNode * Node;
 Node=p;
 printf("\nnum:%ld\nscore:%5.1f\n",(Node)->num,(Node)->score);
 printf("\nnum:%ld\nscore:%5.1f\n",(Node+1)->num,(Node+1)->score);
    printf("\nnum:%ld\nscore:%5.1f\n",(Node+2)->num,(Node+2)->score);
}
int main()
{
 struct StudentNode * p;
 p=creat();
    p=Enter(p,1001,98);
 //p=Delete(p);
 printf("%d",n);
    print1(p);
    //print2(p);
 return 0;
};