Suffix Trees
← Back to Suffix Structures
A compressed trie of all suffixes of a string. Enables O(m) substring search, longest repeated substring, and many other string operations. Built in O(n) time with Ukkonen’s algorithm. More powerful than suffix arrays but requires more memory.