CareerCup 13.2

Compare and contrast a hash table vs. an STL map. How is a hash table implemented? If the number of inputs is small, what data structure options can be used instead of a hash table?

For what I remember, a stl map is usually implemented as a modified B-tree. A hash table is a contiguous array and the elements of the array either stores actual data or be the chain of nodes. 剩下不会。坐等大牛。

toliuweijing 发表于 2012-8-30 04:25
For what I remember, a stl map is usually implemented as a modified B-tree. A hash table is a contig ...

STL map 不是 B-tree 吧

BinaryWitch 发表于 2012-8-31 00:53
STL map 不是 B-tree 吧

恩，红黑树，不懂。。