资源描述：
《线性表...............》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。
1、#include#include"list.c"voidPrintList(constListL)//打印链表{PositionP=Header(L);if(IsEmpty(L))printf("Emptylist");else{do{P=Advance(P);printf("%d",Retrieve(P));}while(!IsLast(P,L));printf("");}}voidChange(ElementTypeX,ListL){PositionP,PPrev,PAfter
2、;P=Find(X,L);if(P->Next!=NULL){PPrev=FindPrevious(X,L);PAfter=P->Next;PPrev->Next=P->Next;P->Next=P->Next->Next;PAfter->Next=P;PrintList(L);}elseprintf("这是最后一个数字，不可交换。");}voidReverse(ListL)//创建一个新的链表将p1的元素插入到T链表中，实现倒置{ListT;PositionP1,P2;T=MakeEmpty(NULL
3、);P1=L->Next;P2=Header(T);while(P1)//P1不为零{Insert(P1->Element,T,P2);//在p2后面插入p1P1=P1->Next;//后动}PrintList(T);}main(){ListL;PositionP;inti,X;inta[]={34,56,20,9,15,5};L=MakeEmpty(NULL);//清空链表P=Header(L);//取链表头，list.c文件中的程序PrintList(L);for(i=0;i<6;i++){Insert
4、(a[i],L,P);//插入到链表中P=Advance(P);//p的下一个元素可改为p=p->next;}PrintList(L);printf("请输入一个元素X:");scanf("%d",&X);Change(X,L);Reverse(L);return0;}#include#include"stackli.c"#defineN10voidConvert(intn,charstr[],unsignedp){inti,t;Stacks=CreateStack();while(n
5、!=0){Push(n%p,s);n=n/p;}for(i=0;!IsEmpty(s);i++){t=Top(s);if(t>=10)str[i]=t-10+'A';elsestr[i]=t+'0';Pop(s);}str[i]=' ';}voidmain(){charstr[N];intn;unsignedp;printf("pleaseinputanumber:");scanf("%d",&n);printf("pleaseinputnumberp:");scanf("%d",&p);Conv
6、ert(n,str,p);printf("theresultis：");printf("%s",str);}#include#include"queue.c"#include"stackar.c"voidmain(){charm;inti;Queueq;q=CreateQueue(20);Stacks;s=CreateStack(20);for(i=0;(m=getchar())!='';i++){Push(m,s);Enqueue(m,q);}while(!IsEmpty(s
7、)){if(Top(s)!=Front(q)){printf("thisisnotaplaom!");break;}Pop(s);Dequeue(q);}if(IsEmpty(s))printf("thisisaplaom!");DisposeStack(s);DisposeQueue(q);}#include#include"MyTree.c"char*extendedPreOrd="ABD@F@@EG@@H@@C@@";voidpreorder(TreeT){if(T){pri
8、ntf("%c",T->Element);preorder(T->Left);preorder(T->Right);}}//前序遍历voidpostorder(TreeT){if(T!=NULL){postorder(T->Left);preorder(T->Right);printf("%c",T->Element);}}//后序遍历voidinorder(TreeT){if(T!=NULL){inorder(
