avatar
P*b
1
Data Structures: How will you use a hashtable to find data in a tree. (Then
he rephrased) suppose I have a hashtable, I want to store the data in a tree
instead of a bucket. How will I do it. What complexity to find an element.
avatar
l*a
2
interview想问把buckets换成BSTs?
如果是的话,还是O(1)平均时间,最坏时间变成O(logn)了。
avatar
s*t
3
第一句没看懂。
第二句是让实现map么?

Then
tree

【在 P*******b 的大作中提到】
: Data Structures: How will you use a hashtable to find data in a tree. (Then
: he rephrased) suppose I have a hashtable, I want to store the data in a tree
: instead of a bucket. How will I do it. What complexity to find an element.

avatar
P*b
4
这个题怎么回答?

Then
tree

【在 P*******b 的大作中提到】
: Data Structures: How will you use a hashtable to find data in a tree. (Then
: he rephrased) suppose I have a hashtable, I want to store the data in a tree
: instead of a bucket. How will I do it. What complexity to find an element.

avatar
y*e
5
平常hashtable都是用buckets/linkedlist来实现的,我对这个题目的理解是,面官问
你,用tree来实现hashtable怎么做。
相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。