AntInLoop

Suffix Tree Data Structure Interactive Visualizer

A Suffix Tree is a compressed Trie of all suffixes of a string, built in linear O(n) time via Ukkonen's algorithm to answer pattern matching and repeated substring queries in O(m) time.

Read Suffix Tree Data Structure Complexity Guide ยท View Code Implementations