Implementation of a Ternary Search Trie, a data structure for storing
String objects that combines the compact size of a binary search
tree with the speed of a digital search trie, and is therefore ideal for
practical use in sorting and searching data.