CareerCup

in C++ i would suggest STL Map.

Map<String,String> Dictionary;
    Dictionary[word] = meaning ;

Advantage :
Maps store data in sorted order , will be beneficial when u need to print all words
starting from particular character

insertion and search in log n
search can be improved if we save iterators for words starting from each character
then when search for particular word is requested , get the saved iterator for first character of that word and search word from there .

an AVL tree would be the best option i think as it has O(log n) search insert and removal.

use Trie

en.wikipedia.org/wiki/Acyclic_deterministic_finite_automaton

Dictionary = Trie

I would have to say AVL or RedBlack tree is best as it has a big O of log(n) both for insertion and searching

Trie is the best option for implementing dictionary. It's like they are made for each other :)

please see en.wikipedia.org/wiki/Directed_acyclic_word_graph