A Suffix Tree is a compressed tree containing all the suffixes of the given text as their keys and positions in the text as their values. Suffix trees pprovide a particularly fast implementation for many important string operations.

All available operations on the Sufix Tree will be shown here. Select an action and provide the necessary input, and the action will be animated in the visualisation area.

View the visualisation here!

As the action is being carried out, each step will be described in the status panel.

You can also follow the psuedocode highlights to trace the algorithm.

Control the animation with the player controls! Keyboard shortcuts are:
Left/right arrows: step backward/step forward
-/+: decrease/increase speed

Return to "Exploration Mode" to start exploring!