another easiest thing to do is to store this in a bst that has a threaded pointer.. so I can just traverse them.. but I don't know how fast is this going to be compared to using a hash table
as if I have a really really large list of words that is unsorted that I wan't to insert into a bst it will take a while.. but with the hash table, it's just O(1)
