华中科技大学计算机 学院课程实验报告 ListEmpty(),which being realized\\n\
getchar();getchar(); if(L1 == NULL)
printf(\L1 exists!\\n\
else {
jud1=ListEmpty(L1); if(jud1==1)
printf(\ else
printf(\ L1 is not empty\\n\
}
}
case 5: {
printf(\
here
is
getchar();getchar(); break;
ListLength() ,which being realized\\n\
getchar();getchar(); if(L1==NULL)
printf(\ else
{jud1=ListLength(L1);printf(\the length of L1 is %d\\n\
}
case 6: {
printf(\ printf(\ scanf(\
getchar();getchar(); break;
being realized\\n\
number of you want to get: \
43
华中科技大学计算机 学院课程实验报告
jud1=GetElem(L1,i,pe1); if(jud1==1)
{printf(\ find it in L1\
else
printf(\ not find it in L1!\\n\
}
case 7: {
printf(\
here
is
getchar();getchar(); break;
LocatElem(),which being realized\\n\
printf(\ scanf(\ if(L1 == NULL)
to search: \
printf(\ else {
jud1 = LocatElem(L1,a,&equal); if(jud1)
printf(\element you find locates No.%d in L1\\n\
else
printf(\not found!\\n\
}
}
case 8: {
here
is
getchar();getchar(); break;
printf(\PriorElem(),which being realized\\n\
44
华中科技大学计算机 学院课程实验报告 if(L1!=NULL) {
printf(\ Input the name you scanf(\ jud1=PriorElem(L1,a,&e1); if(jud1==1)
want find its prior: \
{printf(\prior\\n\
else
printf(\it!\\n\
} else
printf(\is not existed!\\n\
}
case 9: {
printf(\being realized\\n\
if(L1!=NULL) { want find its next: \
{printf(\next\\n\
printf(\it!\\n\
} else
Find the Not find is NextElem(),which
printf(\ Input the name you scanf(\ jud1=NextElem(L1,a,&e1); if(jud1==1)
Find the Not find 45
getchar();getchar(); break;
华中科技大学计算机 学院课程实验报告 printf(\is not existed!\\n\
}
case 10: {
printf(\
here
is
getchar();getchar(); break;
ListInsert(),which being realized\\n\
if(L1!=NULL) {
printf(\the location you scanf(\
printf(\ scanf(\
printf(\ scanf(\
printf(\ scanf(\
want to insert: \
printf(\ Input the QQnumber: \
scanf(\ jud1=ListInsert(&L1,i,a); if(jud1)
Insert
printf(\successfully!\\n\
else
printf(\ } else
printf(\is not existed!\\n\
}
getchar();getchar(); break;
46
华中科技大学计算机 学院课程实验报告
case 11: {
printf(\
here
is
ListDelete(),which being realized\\n\
if(L1!=NULL) {
printf(\the location you scanf(\
jud1=ListDelete(&L1,i,&a); if(jud1)
want to delete: \
{printf(\ Insert successfully! The element that was deleted is:\\n\
else
printf(\ } else
printf(\is not existed!\\n\
if(!strcmp(tablename,\
if(!L1)
// char tablename[9]; /*do{
printf(\ please specify scanf(\
&&
}
case 12: {
printf(\
here
is
getchar();getchar(); break;
ListTrabverse(),which being realized\\n\
liear table name[L1,L2]: \
}while(strcmp(tablename,\
strcmp(tablename,\
47
数据结构课程实验报告-CS1305-U201314927-韩晓阳资料
