9.二叉樹的第i（i≥1）層上所擁有的結(jié)點(diǎn)個(gè)數(shù)最多為(      )

A.2ⁱ                                                           

B.2i    

C.2^i-1                                                          

D.2ⁱ-1

10.設(shè)單鏈表中指針p指向結(jié)點(diǎn)A，若要?jiǎng)h除A的直接后繼，則所需修改指針的操作為(      )

A.p->next=p->next->next                             

B.p=p->next

C.p=p->next->next                                      

D.p->next=p

11.下列排序算法中，某一趟結(jié)束后未必能選出一個(gè)元素放在其最終位置上的是(      )

A.堆排序                                                   

B.冒泡排序

C.直接插入排序                                         

D.快速排序

12.設(shè)字符串S1=″ABCDEFG″，S2=″PQRST″，則運(yùn)算S=CONCAT(SUBSTR(S1,2,LENGTH(S2)),SUBSTR(S1,LENGTH(S2),2))后S的結(jié)果為(      )

A.″BCQR″                                              

B.″BCDEF″  

C.″BCDEFG″                                         

D.″BCDEFEF″

13.在平衡二叉樹中插入一個(gè)結(jié)點(diǎn)后造成了不平衡，設(shè)最低的不平衡結(jié)點(diǎn)為A，并且A的左孩子的平衡因子為-1，右孩子的平衡因子為0，則使其平衡的調(diào)整方法為(      )

A.LL型                                                      

B.LR型     

C.RL型                                                      

D.RR型

14.如果結(jié)點(diǎn)A有3個(gè)兄弟結(jié)點(diǎn)，而且B為A的雙親，則B的度為(      )

A.1                                                            

B.3     

C.4                                                            

D.5

15.數(shù)據(jù)表A中每個(gè)元素距其最終位置較近，則最省時(shí)間的排序算法是(      )

A.堆排序                                                   

.插入排序

C.直接選擇排序                                         

D.快速排序