数据结构上机参考程序

数据结构上机参考程序一元多项式表示及相加程序如下://Add Polynomial Pa and Pb#include<stdlib.h>#include<malloc.h>#include<conio.h>#include<stdio.h>Stuct Term{ float coef;int expn;struct Term *next;}LinkList;LinkList *CreateList_L(int n){int i;LinkList *p,*L;L=(LinkList *)malloc(sizeof(LinkList));L->next=NULL;for(i=n;i>0;--i){p=(LinkList *)malloc(sizeof(LinkList));printf(“input coef=”);scanf(“%d”,&p->coef);printf(“\n”);printf(“input expn=”);scanf(“%d”,&p->expn);printf(“\n”);p->next=L->next;L->next=p;}//end of forReturn L;}//end of function CreateListChar cmp(int qa_expn,int qb->expn){if(qa_expn==qb_expn)return‟=…;elseif(qa_expn>qb_expn)return‟>‟;else return‟<…;}//end of cmp() functionLinkList *Addpolyn(LinkList *pa, LinkList *pb) {LinkList *qa,*qb,*pre,*u;float sum;qa=pa->next;qb=pb->next;pre=pa;while(qa&&qb)switch(cmp(qa->expn,qb->expn)){case …<…:pre=qa;qa=qa->next;break;case‟=…:sum=qa->coef+qb->coef;if(sum!=0.0){qa->coef=sum;pre=qa;}else{pre->next=qa->next;free(qa);}qa=pre->next;u=qb;qb=qb->next;free(u);break;case‟>‟:u=qb->next;qb->next=qa;pre->next=qb;pre=qb;qb=u;break;}//end of switchif(!qa)pre->next=qb;free(qb);return pa;}end of Addpolyn() functionVoid main(){LinkList *pa,*pb,*pc,*p;int NodeNum_pa,NodeNum_pb;Printf(“input NodeNum_pa:”);Scanf(“%d”,& NodeNum_pa);printf(“Please input the pa.coef and pa.expn”);pa=CreateList_L(NodeNum_pa);Printf(“input NodeNum_pb:”);Scanf(“%d”,& NodeNum_pb);printf(“Please input the pb.coef and pb.expn”);pb= CreateList_L( NodeNum_pb);Pc=Addpolyn(pa,pb);P=pc;printf(“result:\n”);while(p->next){p=p->next;printf(“pc.coef=%d, pc.expn=%d\n”, p->coef, p- >expn );}//end of whilegetch();}end of main() function行编辑程序。

例如：输入：whli##ile(s#*s)outcha@putchar(*s=#++);输出：while(*s)putchar(*s++);程序如下：#include<stdio.h>#include<conio.h>#define SIZE 100#define char SElemTypetypedef struct{SElemType sq[SIZE]int top;}SqStack;void push(SqStack *s,SElemType e){if(s->top= =SIZE)printf(“overflow!\n”);else{s->top=s->top+1 ;s->sq[s->top]=e;}}//Pushvoid pop(SqStack *s){if(s->top==-1)printf(“error!\n”);else s->top--;}//Popmain(){ int i; SqStack S; SElemType ch;S.top=-1;printf(“Input:\n”);ch=getchar();while(ch!=…$‟){while(ch!=…$‟&&ch!=…\n‟){switch(ch){case‟#‟:Pop(&S);break;case‟@‟:s.top=-1;break;default:Push(&S,ch);break;}ch=getchar();}printf(“Output:\n”);for(i=0;i<=s.top;i++) printf(“c%”,s.sq[i]);s.top=-1`;if(ch!=…$‟) {printf(“Input:”); ch=getchar();}}}快速转置程序#include<stdio.h>#define SIZE 100typedef struct{int i,j;int e;}Triple;typedef struct{Triple data[SIZE];int mu,nu,tu;}TSMatrix;Main(){TSMatrix T,M;int t,p,q,col ,num[SIZE],cpot[SIZE];printf(“Input M.mu,M.nu,M.tu:”);scanf(“%d,%d,%d”,&M.mu,&M.nu,&M.tu);printf(“\n”);printf(“Input Matrix M:\n”);for(t=1;t<=M.tu;t++){ scanf(“%d,%d,%d”,&M.data[t].i,&M.data[t].j,&M.data[t].e);printf(“\n”);}…书中代码建立排序的二叉树和遍历二叉树#include<stdio.h>typedef struct bnode{int data;struct bnode *left,*right;}BiTree;BiTree *insert(BiTree *b, BiTree *s){if(b==NULL) b=s;else if(s->data==b->data) ;else if(s->data<b->data) b=insert(b->left,s);else if(s->data>b->data) b=insert(b->right,s);return b;}BiTree * createbitree(BiTree* bt){int x;BiTree *s;printf(“Input;”);do{scanf(“%d”,&x);s=(bnode *)malloc(sizeof(bnode));s->data=x;s->left=NULL;s->right=NULL;bt=insert(bt,s);}while(x!=-1);return bt;}void inorder(BiTree * bt){if(bt != NULL){ inorder(bt->lchild);printf(″%d ″,bt->data);inorder(bt->rchild); }}void main(){BiTree*root;root=NULL;root=createbitree(BiTree* root);inorder(BiTree * root);}图的遍历(深度优先)#include<stdio.h>#define MAX_VERTEX_NUM 20typedef int VertexType;typedef struct ArcNode{Struct ArcNode *nextarc;}ArcNode;typedef struct Vnode{VerterType data;ArcNode *firstarc;}VNode,AdjList[MAX_VERTEX_NUM ];int n;boll visited[MAX_VERTEX_NUM ];V oid create(AdjList *g){ArcNode *p,*q;int m,s,d,i;Printf(“请输入顶点数和边数:”);Scanf(“%d,%d”,&n,&m);for(i=1;i<=n;i++){g[i].data=i;g[i].firstarc=NULL;}for(i=1;i<=m;i++){Printf(“第%d条边的起始顶点编号和终止顶点编号:”,i); Scanf(“%d,%d”,&s,&d);While(s<1||s>n||d<1||d>n){Printf(“编号超出范围,重新输入:”);Scanf(“%d,%d”,&s,&d);}P= malloc(sizeof(ArcNode));P->adjvex=d;P->nextarc=NULL;if(!g[s].firstarc) g[s].firstarc=p;else {q=g[s].firstarc;while(q->nextarc) q=q->nextarc;q->nextarc=p;}}}V oid dfs(AdjList *g,int m){int w;if(!visited[m]) printf(“%d”,g[m].data); Visited[m]=true;P=g[m].firstarc;While(p){W=p->adjvex;if(!visited[w]) dfs(g,w);P=p->nextarc;}}V oid main(){int i;AdjList g;Create(&g);for(i=1;i<=n;i++) visited[i]=false;for(i=1;i<=n;i++) dfs(&g,i);}参见书168页图输入:8,181,21,32,12,42,53,13,63,74,24,85,25,86,36,77,37,68,48,5输出:12485367广度搜索void bfs(AdjList g,int n){int i,j,w;arcnode *p;int pri[max];i=1;j=1;//分别指示队头和队尾if(!visited[n]){printf(“%f”,g[n].data); visited[n]=1;pri[j]=n;j++;}while(i<j){p=g[i].firstarc;i++;while(!p){w=p->adjvex;if(!visited[w]){visited[w]=1;printf(“%f”,g[w].data);pri[j]=w;j++;}p=p->nextarc;}}}。