Speeding Up Queries Exponentially

Our goal is to implement a tree data structure that is exponentially faster than Balanced Binary Search Trees, while having "cooler" queries than hashing. A van Emde Boas Tree is a recursvie data structure capable of insert, delete, find, successor, predecessor, max and min queries in at most O(log(log(n))) time. More theoretical background can be found in lecture 4 of MIT's Design and Analysis of Algorithms class. https://ocw.mit.edu/courses/6-046j-design-and-analysis-of-algorithms-spring-2015/resources/mit6_046js15_lec04/