题目内容：
对于一棵有n个结点、深度为h的二叉排序树，当查找一个指定关键字的元素且查找失败时，最多需进行（）次比较。
参考答案：
填空题：对于一棵有n个结点、深度为h的二叉排序树，当查找一个指定关键字的元素且查找失败时，最多需进行（）次比较。
- 题目分类：华为认证考试
- 题目类型：填空题
- 查看权限：VIP
[英译汉 ]This box can hold more books than that one.
[英译汉 ]This box can hold more books than that one.
[英译汉 ]Do you have access to the Internet?
[英译汉 ]Do you have access to the Internet?
[完型填空] Many people would agree that stress is a major problem in modern ...
[完型填空] Many people would agree that stress is a major problem in modern ...
密封圈与电缆护套间隙过大时，可以垫层胶皮。（）A．正确B．错误
密封圈与电缆护套间隙过大时，可以垫层胶皮。（）A．正确B．错误
[完型填空] A hot dog is one of the most popular American foods. It was, named ...
[完型填空] A hot dog is one of the most popular American foods. It was, named ...