资源描述：
《数据结构练习题-分章节练习》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。
1、数据结构练习题-分章节练习导读：就爱阅读网友为您分享以下“数据结构练习题-分章节练习”的资讯，希望对您有所帮助，感谢您对92to.com的支持!数据结构实验指导与练习题//顺序存储的线性表的算法#include#include#defineStatusint#defineOVERFLOW0#defineTRUE1#defineFALSE0#defineOK1#defineMAXSIZE100typedefintElemType;typedefstructlist{ElemTypeelem[MAXSIZE];intlength;}SqList;voidInitList(S
2、qList&L){L.length=0;}/*建立顺序表*/voidCreateList(SqList&L){inti;39printf(scanf(输入表长for(i=1;iscanf(输入元素}//顺序表的遍历voidprintdata(ElemTypee){printf(}voidTraverse(SqListL,void(*visit)(ElemTypee)){inti;printf(for(i=1;iif(i==0)printf(每行显示10个元素visit(L.elem[i-1]);//输出表中元素}printf(--11数据结构实验指导与练习题
3、}//有序顺序表L中插入元素e使序列仍有序voidInsert(SqList&L,ElemTypee){inti,j;if(L.length==MAXSIZE)exit(OVERFLOW);//表满,不能插入for(i=1;i=i;j--)L.elem[j]=L.elem[j-1];//元素后移L.elem[i-1]=e;//插入eL.length=L.length+1;//表长加１}//建立递增有序的顺序表voidCreateList_Sorted(SqList&L){inti,num;ElemTypee;L.length=0;printf(39scanf(print
4、f(for(i=1;i/*Mergetwosortedlists*/voidMergeList(SqListLa,SqListLb,SqList&Lc){int*pa,*pb,*pc;if(La.length+Lb.length>MAXSIZE)exit(OVERFLOW);else{pa=La.elem;pb=Lb.elem;pc=Lc.elem;while(pawhile(pbLc.length=La.length+Lb.length;/*R表长*/--12数据结构实验指导与练习题}}//判断元素是否对称，对称返回TRUE否则返回FALSEStatusSymmetri
5、c(SqListL){intlow,high;low=0;high=L.length-1;while(lowif(L.elem[low]==L.elem[high]){low++;high--;}elsereturn(FALSE);return(TRUE);}//顺序表的主函数部分//#includevoidmain(){SqListL1,L2,L;intselect;ElemTypee;do{printf(printf(printf(scanf(switch(select){case1:InitList(L);CreateList_Sorted(L);39Tra
6、verse(L,printdata);printf(scanf(Insert(L,e);Traverse(L,printdata);break;case2:InitList(L1);CreateList_Sorted(L1);Traverse(L1,printdata);InitList(L2);CreateList_Sorted(L2);Traverse(L2,printdata);InitList(L);--13数据结构实验指导与练习题MergeList(L1,L2,L);Traverse(L,printdata);break;case3:InitList(L);C
7、reateList(L);Traverse(L,printdata);if(Symmetric(L))printf(break;case0:break;default:printf(}}while(select);}/*单向链表的有关操作示例*/--14数据结构实验指导与练习题39/*类型定义及头文件部分,文件名为sllink.h*/#include#includetypedefintElemType;//元素实际类型typedefstructLNode{ElemTypedata;structLNode*nex
