Trees

Suffix Trie

An uncompressed trie that shares prefixes among every suffix of a text.

Learn with an interactive visualization

Category: Trees. Complexity: Search pattern O(m).

An uncompressed trie that shares prefixes among every suffix of a text. Interactive visualization, Java and C++ code, operations, complexity, and a…