Trie or balanced binary search tree to store dictionary?

I'd say use a Trie, or better yet use its more space efficient cousin the Directed Acyclic Word Graph (DAWG) .

If this is C++, you should also consider std::tr1::unordered_set. (If you have C++0x, you can use std::unordered_set.).

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.