ABSTRACT
Strengths: Provides the most space efficient DigitizedOrderedCollection implementation when b > 2.
Weaknesses: Unlike the trie, compact trie, compressed trie, and Patricia trie in which the worstcase time complexity to find, insert and remove an element is proportional to the number of digits, for a ternary search trie the expected time complexity for these methods is O(d log b) where d is the number of digits in the given element.
