Both a sorted array and a binary tree can let you look up an element in log(N) time. However I would expect a sorted array to be faster in practice because of the constant factor. However inserting ...

A trio of new Google Easter eggs display the number of results in the number system of the query. Search the terms "binary", "octal", or "hexidecimal" to see a few fun tricks in the search results ...