van-emde-boas-trees

Closed. This question is off-topic. It is not currently accepting answers. Learn more . Want to improve this question? Update the question so it's on-topic for Stack Overflow. Closed 5 years ago . Is there a reliable C++ implementation of vEB Trees ? Boost doesn't have it. It seems quite unusual. Are there any (maybe commercial) libraries for vEB Trees or y-fast tries or similar data structures? There seems to be a C implementation ... 来源： https://stackoverflow.com/questions/5714516/is-there-a-c-implementation-for-veb-trees

We know balanced trees perform insertion, deletion, and search in O(log n) -time, examples include Red-Black AVL Splay B-tree (and its variants). However, when keys are integers in some limited range, it is possible to use a Van Emde Boas tree to drop these operations down to O(log(log n)) -time, i.e., exponentially better than AVL or RB trees. Well, this is actually the case of many real world applications. I see lots of applications for this. One I'd like to cite is on databases, for which creating indexes basically involves choosing between a Hash or a B*-tree. If a Van Emde Boas tree was