The ternary search tree (TST) is the champion of data structure acrobatics — it finds all keys having a given prefix, suffix, or infix. It even finds those keys that closely match a given pattern.

We will study the suffix trie data structure: a very useful data structure for fast searching over strings. Students can expect a programming assignment at the end of this module. This assignment ...