Read a large file of English dictionary words.
Insert each word in a data structure
Lookup each word.
How fast can we make both the insert and the lookup?
O( log(N) )?
O( 1 )?