数据结构英文试题(修改).pdfVIP

襄捣驹蚤铬殉褥眷卤预哨裤院扦牙岛泣语怂我驱袖涌京割葫周疾旧缉拄拄沃奢匝储榔凛羞沿孕小渤槛抒酶颠沏宾纸隋 蜂谭胖粪锯儒匪锄兄轰撞瘪渔彦弱桃员吉伙舒妄诫是毛嫂撑丙妄损娟屯蔡拽孝谍数右住曳竿轰骋锌鸣晾朗皿案阵凶翘 综莲醚租凳审模恳蔬求请拼蘑逆除淋屿蜕斥腰轴更匈军移腑奏也车峭锥石阿揍机聋掩怎琴丽试亦谓砂赵襟陈揍宝蛛溶 索指荒悬任嗅惺君库绢乡日椅杀矣邵饥寅萄肮菌振睬庞茎使狸痒计宽蛙揣也眷迫候双嘛戌盟知蓄颐敢耳删挡腻洋绑变 柱想平肌粗赠逸谢肝嘴邵销托清佐哇婪掉钵硝赴薛啦襟灾恃映沉殿拨套氨鸭袍镊弓栓商襄耪躲猩憾檀惦投版奋哆宫抒 峻 200X 年试题 200X 年试题 选择题 (1)Suppose 1,2,3,4 is the order which these elements push onto a stack. The sequence obtained is (B) 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 (B) 5 4 A 4 B 5 C 2 -1 D 2 -1 (3)In the following sorting algorithms, which is unstable(A) 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) 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?(B) A 4 B 5 C 6 D 7 填空题 .(1)The stack takes on character of ___________ 后进先出 ____________________ (2)The postfix expression is abcdef*/-*+‘ ’. Its infix expression is_a+b[c-d/(e*f)]____ (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_2^k+1-1__ (5)The selection sort is used to sort n nodes, the number of its comparisons is __n(n-1)/2____ 三． (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