Suffix Tree Ladder¶
Who This Is For¶
Use this ladder when heavier string tools are already comfortable and you want the compressed-index view of one static text.
The intended loop here is:
- hot sheet for retrieval
- one flagship repo note
- topic page when you need the full terminator / compressed-edge refresher
Warm-Up¶
- understand why every suffix needs a unique terminator
- get comfortable matching across edge intervals, not node-by-node characters
Core¶
- one static text as a substring index
- earliest occurrence from subtree minimum suffix start
Retrieval Layer¶
- exact quick sheet -> Suffix Tree hot sheet
- compressed substring-index starter -> suffix-tree.cpp
- flagship repo note -> Pattern Positions
Exit Criteria¶
You are ready to move on when you can:
- explain why a pattern may end in the middle of a compressed edge
- answer earliest occurrence from subtree metadata instead of rescanning the text
- say when suffix tree is a better mental model than suffix array or automaton