链表
1.简单链表
struct student{
long num;
float score;
struct student *next;
}
void main()
{
struct student a,b,c,*head,*p;
//赋值
a.num=98;a.score=97;
b.num=49;b.score=34;
c.num=423;c.score=234;
//创建链表
a.next=&b;
b.next=&c;
c.next=NULL;
p=head;
//输出
{
printf("%d,%d",p->num,p->score);
p=p->next;
}while(p!=NULL);
}