Suffix Trees

A compressed trie of all suffixes of a string.

Expert

Substring search in $O(m)$ , longest repeated substring, and more; built in $O(n)$ by Ukkonen's algorithm. Memory-heavy.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)