Patricia tree
data structure that represents a space-optimized trie in which each node that is the only child is merged with its parent
suffix tree
computer science term: compressed trie containing all the suffixes of the given text
data structure that represents a space-optimized trie in which each node that is the only child is merged with its parent