-The trie.Trie class is a Trie or prefix tree. It can be used with
-arbitrary sequences as keys and stores its values in a tree with paths
-determined by the sequence determined by each key. Thus, it can
-determine whether a value is contained in the tree via a simple
-traversal in linear time and can also check whether a key-prefix is
-present in the tree in linear time.
-