Suffix Tree

A suffix tree is a compressed trie of all suffixes of a string. It efficiently stores and allows rapid searching of patterns within the original string. Unlike a standard trie, shared prefixes among suffixes are condensed into single edges, saving space and enabling faster substring searches, especially in large texts.