题目内容

8. 在二叉树排序树中插入一个新结点,总是插入到叶结点下面。

A. 对
B. 错

查看答案

搜索结果不匹配？点我反馈

更多问题

9. 哈希表是一种将关键字转换为存储地址的存储方法。

A. 对
B. 错

10.在二叉排序树上删除一个结点时,不必移动其它结点,只要将该结点的父结点的相应的指针域置空即可。

A. 对
B. 错

Mike lost ____ new watch while he was playing volleyball at school.

A. his
B. he
C. him

The man has two sons, and of them are strong. One is tall and _ is short.

A. all, another
B. neither, another
C. both, the other