數(shù)據(jù)結(jié)構(gòu)試題答案修改版-展示頁
2025-06-16 19:44本頁面
【正文】 sion is___(3)The advantage of circular queues is ____________.(4)If the depth of full binary tree is k, then the number of nodes in the tree at least___(5)The selection sort is used to sort n nodes, the number of its parisons is ____三．(1) Write a function Deletion in C for linear list(線性表). (5 points)int sq_elete(list,p_n,i) int list[]。/*形參數(shù)組可不指定大小*/ int *p_n,i。 if(i0||i=*p_n) return(1)。j++) list[j1]=list[j]。 return(0)。{ int i,j,m。 j=n1。 if(v==a[m])return(m)。 else i=m+1。}(4)Write some sentences in C which delete the node b in the following figure. (5 point)(附圖)ABCPq =pright。qleftright =qright。(5)Write some sentences in C which insert the node b in the following figure(5pont)(附圖)ACPBq =pright。bright =q。qleft =b。 Position i, lastsmall, pivotpos。 pivot=listentry[low]。 for(i=low+1。i++) if(LT(listentry[i].key, )) Swap(++pivotpos, i, list)。 return pivotpos。 int k。 { *p=NULL。 while(*q!=NULL) if ((*q)key==k) return。 *q=(*q)link。}。 if (NULL ==t) return 。 tleft =tright。 Swap(tleft)。}(2)Write a function in C for linked queue（鏈接隊(duì)列）.(10 point)void Append(QueueEntry x,Queue *q){ if (QueueFull(q)) Error(“cannot append an entry to a full queue.”)。 qrear=(qrear+1)%MAXQUEUE。 } }選擇題D AB D B A(1) In a simple linked list with n nodes, the number of pointer fields with NULL Totals(). A. n
教學(xué)教案相關(guān)推薦
鄂ICP備17016276號-1