数据结构80题参考答案(下)41-80

广工数据结构80道上机题仅供参考最后缺了几题41void swap(ElemType &a,ElemType &b){ElemType t;t=a;a=b;b=t;}void Rotate(Array1D &a, int n, int k)/* a[n] contains the elements, *//* rotate them right circlely by k sits */{int j,l;k=n-k%n-1;for(j=0,l=k;j<l;j++,l--)//前半段{swap(a[j],a[k-j]);}for(j=k+1,l=n-1;j<l;j++,l--)//后半段{swap(a[j],a[l]);}for(j=0,l=n-1;j<l;j++,l--)//全部逆转{swap(a[j],a[l]);}}42Status AddTSM(TSMatrix A,TSMatrix B,TSMatrix &C)/* 三元组表示的稀疏矩阵加法: C=A+B */{if(A.mu!=B.mu||A.nu!=B.nu) return 0;ElemType t;int i=1,j=1,k=1;C.mu=A.mu,C.nu=A.nu,C.tu=0;while(i<=A.tu&&j<=B.tu){if((A.data[i].i==B.data[j].i)&&(A.data[i].j==B.data[j].j))//相等{t=A.data[i].e+B.data[j].e;if(t) //不为0{C.data[k].i=A.data[i].i;C.data[k].j=A.data[i].j;C.data[k].e=t;k++;}i++;j++;}else if((A.data[i].i>B.data[j].i)||(A.data[i].i==B.data[j].i&&A.data[i].j>B.data[j].j))//A 中元素位置大于B中{C.data[k].i=B.data[j].i;C.data[k].j=B.data[j].j;C.data[k].e=B.data[j].e;k++;j++;}else//A中位置小于B{C.data[k].i=A.data[i].i;C.data[k].j=A.data[i].j;C.data[k].e=A.data[i].e;k++;i++;}}while(i<=A.tu){C.data[k].i=A.data[i].i;C.data[k].j=A.data[i].j;C.data[k].e=A.data[i].e;k++;i++;}while(j<=B.tu){C.data[k].i=B.data[j].i;C.data[k].j=B.data[j].j;C.data[k].e=B.data[j].e;k++;j++;}C.tu=k-1;return 1;}43Status GetElem(T2SMatrix M, int i, int j, ElemType &e)/* 求二元组矩阵的元素A[i][j]的值e */{int k=M.cpot[i];if(i>M.mu||i<1||j>M.nu||j<1) return ERROR;//越界..e=0;while(k<M.cpot[i+1])//直到下一行的第一个非零元{if(M.data[k].j==j)e=M.data[k].e;k++;}return OK;}44void OutCSM(CrossList M, void(*Out3)(int, int, int))/* 用函数Out3,依次以三元组格式输出十字链表表示的矩阵*/ {int i=0;OLink p;while(i<=M.mu){if(M.rhead[i]){p=M.rhead[i];while(p){Out3(p->i,p->j,p->e);p=p->right;}}i++;}}45int GListDepth(GList ls)/* Return the depth of list */{int max,dep;GList p;if(!ls) return 1;if(ls->tag==0) return 0;for(max=0,p=ls;p;p=p->un.ptr.tp){dep=GListDepth(p->un.ptr.hp);max=max>dep?max:dep;}return max+1;}46Status Equal(GList A, GList B)/* 判断广义表A和B是否相等,是则返回TRUE,否则返回FALSE */{if(!A&&!B) return TRUE;if(!A->tag&&!B->tag&&A->un.atom==B->un.atom) return TRUE;//原子时比较if(A->tag&&B->tag)//不是原子,子表递归{if(Equal(A->un.ptr.hp,B->un.ptr.hp)&&Equal(A->un.ptr.tp,B->un.ptr.tp))return TRUE;}return FALSE;}47void OutAtom(GList A, int layer, void(*Out2)(char, int))/* 递归地用函数Out2输出广义表的原子及其所在层次,layer表示当前层次*/{if(!A) return ;if(!A->tag) Out2(A->un.atom,layer);else{OutAtom(A->un.ptr.hp,layer+1,Out2);OutAtom(A->un.ptr.tp,layer,Out2);}}48Status Dencendant(Array1D L,Array1D R,int n,int u,int v)/* If node 'u' is the dencendant of node 'v', *//* then return 'TRUE' else return 'FALSE'. *//* L[i] is the left child of the i_th node, *//* R[i] is the right child of the i_th node *//* in the Binary Tree which has n nodes. */{if(u<=0||u>n) return FALSE;if(u==L[v]||u==R[v]) return TRUE;while(L[v])if(Dencendant(L,R,n,u,L[v])) return TRUE;while(R[v])if(Dencendant(L,R,n,u,R[v])) return TRUE;return FALSE;}49Status Dencend(Array1D L, Array1D R, int n, int u, int v, Array1D T)/******************************************************************/ {int i;if(u>n||u<=0) return FALSE;T[1]=0;for(i=1;i<=n;i++){if(L[i]) T[L[i]]=i;if(R[i]) T[R[i]]=i;}while(T[u]){if(T[u]==v) return TRUE;u=T[u];}return FALSE;}50Status Similar(BiTree t1, BiTree t2)/* 判断两棵二叉树是否相似的递归算法*/{if(!t1&&!t2) return TRUE;if((!t1->lchild&&t2->lchild)||(t1->rchild&&!t2->rchild)) return FALSE;if(Similar(t1->lchild,t2->lchild)&&Similar(t1->rchild,t2->rchild)) return TRUE;return FALSE;}51void PreOrder(BiTree bt, void (*visit)(TElemType))/* 使用栈，非递归先序遍历二叉树bt，*//* 对每个结点的元素域data调用函数visit */{Stack s;BiTree p=bt;InitStack(s);while(p||!StackEmpty(s)){if(p){visit(p->data);//访问根节点Push(s,p);p=p->lchild;}else{Pop(s,p);p=p->rchild;//右孩子}}}52void PostOrder(BiTree bt, void (*visit)(TElemType)) /* 使用栈，非递归后序遍历二叉树bt，*//* 对每个结点的元素域data调用函数visit */ {Stack s;SElemType p,q;p.ptr=bt;InitStack(s);Push(s,p);//根节点入栈p.tag=0;while(!StackEmpty(s)){Pop(s,p);//顶点元素出栈if(p.tag) visit(p.ptr->data);//可访问else{p.tag=1;Push(s,p);//root入栈q=p;if(p.ptr->rchild){q.ptr=p.ptr->rchild;q.tag=0;Push(s,q);//右孩子入栈}q=p;if(p.ptr->lchild){q.ptr=p.ptr->lchild;q.tag=0;Push(s,q);//左孩子入栈}}}}53TElemType ans;TElemType f(BiTree bt, int &k){if(bt&&k==1) return bt->data;else{if(bt->lchild){k--;ans=f(bt->lchild,k);}//遍历zuoif(bt->rchild){k--;ans=f(bt->rchild,k);}//遍历右return ans;}}TElemType PreOrder(BiTree bt, int k)/* bt is the root node of a binary linked list, *//* Preorder travel it and find the node whose */ /* position number is k, and return its value. */ /* if can't found it, then return '#'. */ {ans='#';if(k&&bt)ans=f(bt,k);return ans;}54int ans=0;//全局变量void f(BiTree bt, int &x);void Leaves(BiTree bt, int &x)/* Count the leaf node of the BiTree *//* whose root node is bt to x. */{ans=0;if(!bt->lchild&&!bt->rchild) x=0;else f(bt,x);}void f(BiTree bt, int &x)//求叶子数目{if(!bt->lchild&&!bt->rchild) ans++;else if(!bt->lchild) f(bt->rchild,x);//左为空else if(!bt->rchild) f(bt->lchild,x);//右为空else//都不空{f(bt->rchild,x);f(bt->lchild,x);}x=x>ans?x:ans;}55void Exchange(BiTree &bt)/* Exchange the left and right leaves of *//* bitree whose root node is bt */{BiTree t;if(bt)//不空则交换左右孩子{t=bt->lchild;bt->lchild=bt->rchild;bt->rchild=t;Exchange(bt->lchild);//遍历左孩子Exchange(bt->rchild);//右}}56int ans=0;int dep(BiTree T)//求子树深度{int ld,rd;if(!T) return 0;else{ld=dep(T->lchild);rd=dep(T->rchild);}return (ld>rd?ld:rd)+1;}int Depthx(BiTree T, TElemType x)/* 求二叉树中以值为x的结点为根的子树深度*/ {if(T->data==x)//找到结点计算高度{ans=dep(T);return ans;}else{if(T){if(Depthx(T->lchild,x)||Depthx(T->rchild,x)) return ans;//找到则返回结果else return 0;//找不到返回0}}}57void CopyBiTree(BiTree T, BiTree &TT)/* 基于层次遍历的非递归复制二叉链表*/{Queue q,cq;BiTree t;QElemType e,ce;if(!T){TT=NULL;return;}InitQueue(q);InitQueue(cq);//复制树队列TT=(BiTree)malloc(sizeof(BiTNode));TT->data=T->data;//复制根结点TT->lchild=NULL;TT->rchild=NULL;EnQueue(cq,TT);EnQueue(q,T);//根入队while(!QueueEmpty(q)){DeQueue(q,e);DeQueue(cq,ce);if(e->lchild)//复制左{t=(BiTree)malloc(sizeof(BiTNode));t->data=e->lchild->data;t->lchild=NULL;t->rchild=NULL;ce->lchild=t;EnQueue(q,e->lchild);//左孩子入队EnQueue(cq,ce->lchild);}if(e->rchild)//复制右{t=(BiTree)malloc(sizeof(BiTNode));t->data=e->rchild->data;t->lchild=NULL;t->rchild=NULL;ce->rchild=t;EnQueue(q,e->rchild); //右孩子入队EnQueue(cq,ce->rchild);}}}58void LevelOrder(BiTree bt, char *ss)/* travel BiTree bt by level, Return result by ss. */ {if(!bt){ss="";return;}int i=0;Queue q;QElemType e;InitQueue(q);EnQueue(q,bt);//根入队ss[i++]=bt->data;while(!QueueEmpty(q)){DeQueue(q,e);if(e->lchild){ss[i++]=e->lchild->data;EnQueue(q,e->lchild);//左孩子入队}if(e->rchild){ss[i++]=e->rchild->data;EnQueue(q,e->rchild);//右孩子入队}}ss[i]='\0';}59Status CompleteBiTree(BiTree bt)/* judge if the binary tree whose root is bt *//* is a complete tree. */ {if(!bt) return TRUE;int i=0;Queue q;QElemType e;InitQueue(q);EnQueue(q,bt);//根入队while(!QueueEmpty(q)){DeQueue(q,e);if(!e) i=1;//已经到最后else if(i) return FALSE;//不是完全二叉树else{EnQueue(q,e->lchild);//左孩子入队EnQueue(q,e->rchild);//右孩子入队}}return TRUE;}60int find(char c,char *pre,int pos){int i;for(i=pos;pre[i]!='\0';i++)if(c==pre[i]) return i;return i;}void BuildBiTree(BiTree &bt, int ps, char *pre,int is, char *ino, int n)/* 当前要建立的子树bt的元素总数为n，*//* 元素在前序序列pre的起始位置为ps，*//* 元素在中序序列ino的起始位置为is */{int m,llen,rlen;if(n<=0) bt=NULL;else{bt=(BiTree)malloc(sizeof(BiTNode));bt->data=pre[ps];//创建结点,pre数组中m=find(pre[ps],ino,is);//在pre中从is起找与pre[ps]相同的元素位置llen=m-is;//以m为根,左边个数rlen=n-llen-1;//右边元素个数BuildBiTree(bt->lchild,ps+1,pre,is,ino,llen);//构造左边BuildBiTree(bt->rchild,ps+llen+1,pre,m+1,ino,rlen);//右边}}61Status DfsReachable(ALGraph g, int i, int j)/* Judge if it exists a path from vertex 'i' to *//* vertex 'j' in digraph 'g'. *//* Array 'visited[]' has been initialed to 'false'.*/{ArcNode *p;visited[i]=TRUE;for(p=g.vertices[i].firstarc;p;p=p->nextarc){if(p){if(p->adjvex==j) return TRUE;if(!visited[p->adjvex])if(DfsReachable(g,p->adjvex,j)) return TRUE;}}return FALSE;}62Status BfsReachable(ALGraph g, int i, int j)/* Determine whether it exists path from vertex i to *//* vertex j in digraph g with Breadth_First Search. *//* Array 'visited' has been initialed to 'false'. */{Queue q;int t;ArcNode *p;InitQueue(q);EnQueue(q,i);while(!QueueEmpty(q)){DeQueue(q,t);visited[t]=TRUE;//标志走过for(p=g.vertices[t].firstarc;p;p=p->nextarc){if(p->adjvex==j) return TRUE;//存在路径if(!visited[p->adjvex]) EnQueue(q,p->adjvex);}}return FALSE;}63void Traverse(Graph dig, V ertexType v0, void (*visit)(V ertexType)) /* Travel the digraph 'dig' with Depth_First Search. */{int i,w;if(dig.vexnum==0) return ;for(i=0;i<dig.vexnum;i++) visited[i]=0;SStack s;InitStack(s);Push(s,v0);while(!StackEmpty(s)){GetTop(s,v0);//取栈顶元素i=LocateV ex(dig,v0);//v0的位置if(!visited[i]){visited[i]=1;visit(v0);}for(w=FirstAdjV ex(dig,i);w>=0;w=NextAdjV ex(dig,i,w))//查找v0的邻接点{if(!visited[w])//未访问则入栈,取栈顶元素{Push(s,GetV ex(dig,w));break;}}if(w<0) Pop(s,v0); //出栈}}64Status SinglePath(ALGraph g, V ertexType sv, V ertexType tv, int k, char *sp)/* Judge whether it exists a path from sv to tv with length k *//* in graph g, return path using string sp if exists. */{int i,j,q;//从sv开始深搜到tvArcNode *p;if(sv==tv&&!k)//两点重合{inpath(sp,sv);return OK;}i=LocateV ex(g,sv);//找sv的位置visited[i]=1;inpath(sp,sv);//sv加入路径for(p=g.vertices[i].firstarc;p;p=p->nextarc)//遍历i点的邻接点{q=p->adjvex;if(!visited[q]){if(SinglePath(g,g.vertices[q].data,tv,k-1,sp)) return OK;//存在路径else depath(sp,g.vertices[q].data);//从路径中删除}}visited[i]=0;//重置return FALSE;}65void APath(ALGraph g, V ertexType sv, V ertexType tv,StrARR &path, int &i,char *sp){int k,j,q,n;//从sv开始深搜到tvArcNode *p;k=LocateV ex(g,sv);//找sv的位置visited[k]=1;inpath(sp,sv);//sv加入路径if(sv==tv)//存在路径{for(n=0;sp[n]!='\0';n++){path[i][n]=sp[n];}path[i][n]='\0';//.....上一组数据会留下杂物,要清掉..i++;}elsefor(p=g.vertices[k].firstarc;p;p=p->nextarc)//遍历k点的邻接点{q=p->adjvex;if(!visited[q]){APath(g,g.vertices[q].data,tv,path,i,sp);}}depath(sp,sv);visited[k]=0;//重置}void AllPath(ALGraph g, V ertexType sv, V ertexType tv,StrARR &path, int &i)/* Get all the paths from vertex sv to tv, save them *//* into Array path which contains string components. *//* Return the number of path using i */ {char spa[MAX_VERTEX_NUM+1];APath(g,sv,tv,path,i,spa);}66.67.68.int Search(SSTable a, KeyType k)/* Index the element which key is k *//* in StaticSearchTable s. *//* Return 0 if x is not found. */{int i;for(i=1;i<=a.length;i++)//下标从1开始..- -if(a.elem[i].key==k) return i;return 0;}69.int BinSearch(SSTable s, int low, int high, KeyType k)/* Index the element which key is k *//* in StaticSearchTable s. *//* Return 0 if x is not found. */{while(low<=high){int mid=(low+high)/2;if(s.elem[mid].key==k) return mid;else if(s.elem[mid].key>k)return BinSearch(s,low,mid-1,k);elsereturn BinSearch(s,mid+1,high,k);}return 0;}70.Status IsBSTree(BiTree t)/* 判别给定二叉树t是否为二叉排序树。