文档介绍：数据结构上机实验-约瑟夫环、数制转换、字符串删除、二叉树遍历一、约瑟夫环:#include<>#include<>#include<>typedefstructnode{intdata;structnode*next;}Seqlist,*LinkList;LinkListp;LinkListcreate_LinkList(void){p=(LinkList)malloc(sizeof(Seqlist));if(p)p->next=NULL;returnp;}voidshow_List(LinkListp,intx){inti;linklisthead,q;head=(LinkList)malloc(sizeof(Seqlist));head=p;for(i=1;i<=x;i++){q=(LinkList)malloc(sizeof(Seqlist));q->data=i;q->next=NULL;p->next=q;p=q;}p->next=head->next;}voidjosphus_LinkList(LinkListq,ints,intm){inti;LinkListp,rep;p=q;if(!p)printf("表中无元素");for(i=0;i<s;i++){p=p->next;}while(p!=p->next){for(i=1;i<=m;i++){rep=p;p=p->next;}rep->next=p->next;printf("%d",p->data);free(p);p=rep->next;printf("%d",p->data);}main(){inti,j,k;p=(LinkList)malloc(sizeof(Seqlist));p=create_LinkList(p);printf("输入总人数:number:");scanf("%d",&k);show_List(p,k);printf("请输入开始的位置:Start:");scanf("%d",&i);printf("请输入间隔数:members:");scanf("%d",&j);printf("顺序输出的结果为:\n");josphus_LinkList(p,i,j);}二、数制转换:正数的转换:#include<>#include<>#include<>#defineMAXSIZE100structstack{intdate[MAXSIZE];inttop;};typedefstructstackSeqstack,*Pstack;PstackS;PstackCreat_stack(PstackS){S=(Pstack)malloc(sizeof(Seqstack));if(S)S->top=-1;returnS;}intEmpty_stack(PstackS){if(S==NULL){return1;}voidPush_stack(PstackS,intx){if(Empty_stack(S)){printf("空栈\n");}else{S->date[S->top+1]=x;S->top++;}}voidPop_stack(PstackS,int*x){if(Empty_stack(S)){printf("空栈\n");}else{*x=S->date[S->top];S->top--;}}voidGet_Top_stack(PstackS,int*x),if(Empty_stack(S)){printf("空栈\n");}else{*x=S->date[S->top];}}voidDestroy_stack(Pstack*S){if(*S)free(*S);*S=NULL;}voidconversion(PstackS,doublen,intr){doublef=0;inti;i=int(n);f=n-i;intx;if(!S)printf("栈已被初始化/n");while(i){Push_stack(S,i%r);i=i/r;}while(S->top!=-1){Pop_stack(S,&x);if(x==1)printf("A");elseif(x==2)printf("B");elseif(x==3)printf("C");elseif(x==4)printf("D");elseprintf("%d",x);}Destroy_stack(&S);intdata[MAXSIZE];intrear=0,front=0;if(f!=0){while(f){data[rear]=int(f*r);f=f*r-int(f*r);rear++;}