问题 填空题

二叉排序树的平均检索长度为【 】。

答案

参考答案:O(log2n)

解析:二叉排序树和二分法的平均检索长度都为O(log2n)。

写句子

按要求写句子。 

1.我们怎么能被困难吓倒呢?(改成陈述句) 

                                                                                                                     

2.他的话没有完全错。(改变词序,改变句意) 

                                                                                                                     

3.纪昌很值得我们去学习。(改成反问句) 

                                                                                                                    

4.普罗米修斯的故事很感人。(改成感叹句)  

                                                                                                                    

5.河水绕着村子。河水缓缓地流着。(合成一句)

                                                                                                                   

6.小明盆子门窗。(用两个以上的动词写一句话) 

                                                                                                                    

判断题