Google interview question

which 2 datastructures will you use to design a dictionary .

Interview Answers

Anonymous

9 Mar 2010

i answered ...hashtable and tree

Anonymous

1 July 2010

I would say a trie/radix tree for efficient word searching, and LinkedList for the definitions of the word. This even allow to link words together (for example : "Please see: word:"). If you say HashTable, never assume its implementation is correct. If you want to use a hash table, then explain what kind you will be using, for example: "Perfect Hashtable (a hash table where each bucket holds another hash table)".