vebtrees

A Rust Implementation of Van Emde Boas Trees

Introduction

Van Emde Boas trees are a cool data strucuture because they can implement all associative array functions in O(loglog(M)) where M is the maximum capacity of the tree.

Acknowlegdements

Cormen, Thomas H., et al. Introduction to Algorithms, 3rd Edition. MIT Press, 2009.

“Van Emde Boas Tree.” Wikipedia, 2017, en.wikipedia.org/wiki/VanEmdeBoas_tree.