printf(\元素%d无后继\\n\ case 7:printf(\ scanf(\ printf(\ scanf(\ if(ListInsert_L(L,i,e)==ERROR) printf(\值不合法\\n\\n\ else{ printf(\新的线性表为：\\n\ for(p=L->next;p;p=p->next) printf(\ printf(\ case 8:printf(\ scanf(\ if(ListDelete_L(L,i,&e)==ERROR) printf(\值不合法\\n\\n\ else{ printf(\被删除的第%d个元素的值为%d\\n\ printf(\新的线性表为：\ for(p=L->next;p;p=p->next) printf(\ printf(\ case 9:ListTraverse_L(L,i);break; case 10:ClearList_L(L); printf(\清空L\ case 0:printf(\操作结束\\n\ default:printf(\输入选择出错！\\n\ } }while(select!=0); DestroyList_L(&L); }
五.实验结果
题目一:
题目二:
