> See also: > - Reference # Trie Data Structures Suffix Trees: Insert all suffices (substring ending at end of original string) into a trie - High memory cost (Can be solved by compression techniques) - Hoffman Tree: - Compression