填空题:对于一棵有n个结点、深度为h的二叉排序树,当查找一个指定关键字的元素且查找失败时,最多需进行()次比较。

  • 题目分类:华为认证考试
  • 题目类型:填空题
  • 号外号外:注册会员即送体验阅读点!
66题库!
题目内容:
对于一棵有n个结点、深度为h的二叉排序树,当查找一个指定关键字的元素且查找失败时,最多需进行()次比较。
参考答案:【答案仅供学习,请勿对照自行用药等】

本题答案需会员方可查看![ 注册 ][ 登陆 ]

[英译汉 ]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 ...

查看答案