DSA · Theory

Suffix Trees

Theory

436/810

Asha only reaches for Suffix Trees when Asha walking through Suffix Trees has to stay correct in a small live site.

For Suffix Trees, a dry-run table is in play. Don’t blame it until you have traced Asha walking through Suffix Trees.

Without Suffix Trees, a small live site gets messy and Asha walking through Suffix Trees is hard to trust.

Asha ships Suffix Trees in a small live site. That is the use case worth saying.

If Asha walking through Suffix Trees breaks under Suffix Trees, check copy-pasting Suffix Trees without a dry-run first.

After Suffix Trees, Asha should still remember copy-pasting Suffix Trees without a dry-run.

Viva for Suffix Trees: what it is → one Suffix Trees step Asha can write from memory → the mistake (copy-pasting Suffix Trees without a dry-run).

Exam tip

For Suffix Trees: definition + a small live site + one failure.

# Suffix Trees
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Suffix Trees: dry-run [4, 1, 3]. Say the list after one step.

DefSuffix Trees — Asha uses it for Asha walking through Suffix Trees in a small live site.
RuleSuffix Trees → one Suffix Trees step Asha can write from memory.
RememberSuffix Trees + a dry-run table (a small live site).
UseSuffix Trees in a small live site (Asha walking through Suffix Trees).
TrapSuffix Trees — copy-pasting Suffix Trees without a dry-run.
ExSuffix Trees → Asha walking through Suffix Trees.