What operations does a van Emde Boas tree support and what are the time complexities? — All are O(log log M), where M is the total number of items that can be stored = 2^m Or O(log m) where m is the actual number of items stored Space: O(M) Search Insert Delete Predecessor Successor