van Emde Boas Tree

Trees are great, but they get pretty slow and inefficient when a lot of data is added. As a result, van Emde Boas trees caught my attention as they promised O(log(log(U))) runtime. This project aimed to understand the fundamental structure of how a van Emde Boas (vEB) works, what makes it so special, and why they are not a popular choice for software development.

• Here is the full PDF report on this project
• Here is the GitHub repo with the C++ code used to creating and testing the tree