数据结构习题与实验目录习题一..............................................................................................................................................1习题二..............................................................................................................................................4习题三..............................................................................................................................................7一元多项式之和实验.......................................................................................................................8哈夫曼树实验................................................................................................................................13求最小生成树算法实验.................................................................................................................17拓扑排序算法................................................................................................................................22求最短路径（迪接斯特算法）.....................................................................................................28关键路径........................................................................................................................................35快速排序........................................................................................................................................43习题一①、请设计一算法：已知顺序表L，表中元素为整型且递增有序，现有一值为e的元素要插入L表，使插入后L表仍然有序。②、已知L为非递减的顺序表，请设计算法删除L中重复的元素（即删除后使L表变为一递增表）。#include#include#include#defineLIST_SIZE100#defineOK1typedefstruct{int*elem;intlength;intlistsize;}SqList;intInitList_Sq(SqList&L){L.elem=(int*)malloc(LIST_SIZE*sizeof(int));if(!L.elem)exit(0);L.length=0;L.listsize=LIST_SIZE;returnOK;}voidListCreate(SqList&L,inti){if(i>L.listsize)exit(0);for(intj=0;jp;q--){*q=*(q-1);}*p=e;k=1;break;}elsep++;}if(k==0){*(q+1)=e;}L.length++;returnOK;}voidmain(){voidListCreate(SqList&L,inti);intInitList_Sq(SqList&L);intSortInsert(SqList&L,inte);inti;SqListLa;InitList_Sq(La);ListCreate(La,3);inta;printf("需要插入的数字：");scanf("%d",&a);SortInsert(La,a);printf("插入后的元素列表变为：\n");for(i=0;i#include#includetypedefstructLNode{intdata;structLNode*next;}LNode,*LinkList;voidmain(){voidCreatList_LinkList(LinkList&L,intn);voidListInsert_LinkList(LinkList&L,intx);voidPrint_LinkList(LinkList&L,intn);LinkListLa;inta,b;printf("请问要输入多少数：");scanf("%d",&a);printf("...
