链表实验报告.doc

链表实验报告.docC语言实验报告
实验目的：链表的基本操作添加，删除，排序
#include <>
#include <>
#include <>
struct StuNode
(
charID[10];
char Name [10];
int Height;
StuNode *next;
)；
typedef StuNode stulist;
void Addafter (stulist * list,char * id,char * name,int height)
(
if(!listll!id) return;
StuNode *p=new StuNode;
strcpy(p->ID,id);
strcpy(p->Name,name);
p->Height=height;
StuNode *q=list;
while(q->next)
{
q=q->next;
}
q->next=p;
p->next=NULL;
}
void ShowNode(stulist * list)
{
cout«n现有数据是：n«endl;
StuNode *p=list->next;
while(p)
cout«p->ID«" H«p->Name«" "«p->Height«endl; p=p->next;
coutv vendlv v" *************************************” }
void Insert (stulist * list)
(
char Beid[10]=H2014002n;
char id[10]=n1112223n;
char name[10]=n 狗蛋”；
int height=177;
if(!listll!id) return;
StuNode *p=new StuNode;
strcpy(p->ID,id);
strcpy(p->N ame,name);
p->Height=height;
StuNode *q=list;
while(strcmp(q->ID,Beid) !=0)
{
q=q->next;
}
p->next=q->next;
q->next=p;
}
void Delete(stulist * list)
(
char id[10]=n2014001H;
StuNode *q=list;
StuNode *d=q->next;
while(strcmp(d->ID,id) !=0)
{
q=q->next;
d=d->next;
)
q->next=d->next;
delete d;
}
void main()
{
stulist list_l;
list_l .next=NULL;
char name[10],id[10];
int height;
Addafter(&list_l,"201400r1,"张三 ”,175);
Addafter(&list_l, ”2014002”,” 李四 ”,180);
Addafter(&list_l,"2014003",n 王二”,173