线表................doc

#include #include list.cvoidPrintList( const List L )/打印链表 Position P = Header( L ); if( IsEmpty( L ) ) printf( Empty listn ); else do P = Advance( P ); printf( %d , Retrieve( P ) ); while( !IsLast( P, L ) ); printf( n ); void Change(ElementType X,List L)Position P,PPrev,PAfter;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); else printf(这是最后一个数字，不可交换。n);void Reverse(List L)/创建一个新的链表将p1的元素插入到T链表中，实现倒置List T;Position P1,P2;T=MakeEmpty( NULL );P1=L-Next;P2=Header( T );while(P1)/P1不为零 Insert(P1-Element,T,P2);/在p2后面插入p1P1=P1-Next;/后动 PrintList(T);main( ) List L; Position P; int i,X;int a=34,56,20,9,15,5; L = MakeEmpty( NULL );/清空链表 P = Header( L );/取链表头，list.c文件中的程序 PrintList( L ); for( i = 0; i next; PrintList(L);printf(请输入一个元素X:n);scanf(%d,&X);Change(X,L);Reverse(L); return 0;# include# includestackli.c# define N 10void Convert (int n, char str, unsigned p)int i,t;Stack s=CreateStack();while(n!=0)Push(n%p,s);n=n/p;for(i=0;!IsEmpty(s);i+)t=Top(s);if(t=10)stri=t-10+A;elsestri=t+0;Pop(s);stri=0;void main()char strN;int n;unsigned p;printf(please input a number:n);scanf(%d,&n);printf(please input number p:n);scanf(%d,&p);Convert(n,str,p); printf(the result is：n); printf(%sn,str);#include#includequeue.c#includestackar.cvoid main()char m;int i;Queue q;q=CreateQueue(20);Stack s;s=CreateStack(20);for(i=0;(m=getchar()!=n;i+)Push(m,s);Enqueue(m,q);while(!IsEmpty(s)if(Top(s)!=Front(q)printf(this is not a plaom!n);break;Pop(s);Dequeue(q);if(IsEmpty(s)printf(this is a plaom!n);DisposeStack(s);DisposeQueue(q);# include# include MyTree.cchar *extendedPreOrd = ABDFEGHC;void preorder(Tree T)if(T)printf(%c,T-Element);preorder(T-Left);preorder(T-Right);/前序遍历void postorder(Tree T)if(T!=NULL)postorder(T-Left);preorder(T-Right);printf(%c,T-Element);/后序遍历void inorder(Tree T)if(T!=NULL)inorder(T-Left);inorder(T-Right);printf(%c,T-Element);/中序遍历int CountFull(Tree T)if( T=NULL ) return 0; if(T-Left!=NULL & T-Right!=NULL)return(1+CountFull(T-Left)+CountFull(T-Right);/if(T-Left!=NULL | T-Right!=NULL)return (CountFull(T-Left)+CountFull(T-Right);/计算满节点数int CountNode(Tree T)if(T=NULL)return 0;else return(1+CountNode(T-Left)+CountNode(T-Right); /计算节点数int CountLeaves( Tree T ) if( T = NULL ) return 0; if( T-Left = NULL & T-Right = NULL ) return 1; return (CountLeaves(T-Left) + CountLeaves(T-Right);/计算叶子节点数int find( Tree T,ElementType a)if(T=NULL)return 0;elseint i=0;if(T-Element=a)i=1;return(i+find(T-Left,a)+find(T-Right,a);/查找节点void main()char a;Tree T;T = BinTreeBuildFrmStr ( &extendedPreOrd );PrintTree ( T );printf(preorder is :);preorder(T);printf(n);printf(inorder is :);inorder(T);printf(n);printf(postorder is :);postorder(T);printf(n);printf(please inpit a char you want to find:n);a=getchar();if(find(T,a)printf(truen);else pr