ABSTRACT
Strengths: The search path to any element is exactly the number of digits (including the end of string character) in the element. Thus, no comparisons are made when searching for an element.
Weaknesses: A trie generally requires significantly more space than the other DigitizedOrderedCollection data structures, except when the collection is dense meaning that most elements share a relatively long common prefix with another element in the collection.
