Ternary search trees are specialized structures for storing and retrieving strings.
At each level, just like a binary search tree, each left node is smaller
Searching for a word:
Just like searching a binary search tree, you start at the root and follow links left and right as appropriate
