数据结构试题答案修改版.docVIP

选择题 B B A A B (1)Suppose 1,2,3,4 is the order which these elements push onto a stack. The sequence obtained is () A.4.1.2.3 B.3.2.4.1 C.3.4.1.2 D.4.3.1.2 (2)Suppose that a linear list contains n=31 nodes, the binary search is applied to the list, the maximum times in searching is () A 4 B 5 C 25-1 D 24-1 (3)In the following sorting algorithms, which is unstable() A Selection sort B Merge sort C Bubble sort D Insertion sort (4)Bubble sort is used for n nodes, the minimum number of comparisons is () A n-1 B n C n(n-1/2) D n(n+1)/2 (5)How many binary trees in different forms can at most be built by three nodes?() A 4 B 5 C 6 D 7 后进先出 a+b[c-d/(e*f)] 克服队满溢出 2^(k+1)-1 n(n-1)/2 填空题 .(1)The stack takes on character of ____________________________ (2)The postfix expression is ‘abcdef*/-*+’. Its infix expression 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 comparisons is ____ 三．(1) Write a function Deletion in C for linear list(线性表). (5 points) int sq_elete(list,p_n,i) int list[];/*形参数组可不指定大小*/ int *p_n,i; { int j; if(i0||i=*p_n) return(1); for(j=i+1,j*p_n;j++) list[j-1]=list[j]; (*p_n)--; return(0); } (2)Write a function Pop in C for linked stack（链接栈）. (5 points) (3)Write a function in C for binary search（2分查找）. (10 point ) int bisect(a,n,v) int a[],v, n; { int i,j,m; i=0; j=n-1; while(i=j){ m=(i+j)/2; if(v==a[m])return(m); if(va[m]) j=m-1; else i=m+1; } return(-1); } (4)Write some sentences in C which delete the node b in the following figure. (5 point)(附图) q =p-right; //set q point to node B q-right-left =q-left; q-left-right =q-right; freee(q); (5)Write some sentences in C which insert the node b in the following figure(5pon