I'm researching in-memory data structures that provide fast lookup time, like Hashtables and T-trees. I'm trying to find out what would be the best data structure to use when I have a table composed of keyfields and datafields, where you can retrieve the datafield by looking up the keyfield. The keyfield would be a word, and the datafield would be the definition of the word.
Some questions I have:
Which data structure is better suited for this, a hashtable or a T-tree?
Where can I find source code examples for these structures (preferably in C++ or C)