Map of words and node numbers with a trie.
Build the dictionary. Raise ValueError if the empty string is contained in the words.
Return the leaf node number if the query exists in the tree and throws KeyError if not exist.
Return the word the associated node number.
See Implementation
Map of words and node numbers with a trie.