Let S be a string in which some substring occurs at least twice. You build the suffix tree of S, with the terminator $ appended to S first. A node of the tree spells the characters on the path from the root down to it.
Which node spells a longest substring that occurs at least twice in S?

Question

Let S be a string in which some substring occurs at least twice. You build the suffix tree of S, with the terminator $ appended to S first. A node of the tree spells the characters on the path from the root down to it.

Which node spells a longest substring that occurs at least twice in S?

Accepted Answer

An internal node with the most characters on its path from the root (if several are tied, any of them)

Answer

The internal node, other than the root, with the most leaves in its subtree

Answer

The leaf with the most characters on its path from the root

Answer

The internal node, other than the root, with the most children

Crowdly

Let S be a string in which some substring occurs at least twice. You build the...

Want instant access to all verified answers on learning.monash.edu?