++ Wow, thank you for introducing me to suffix trees. What an interesting concept, and how refreshing to see a linear-time algorithm for constructing such a creature.
, which others may want to check out.
However, I'd like to slightly revise the algorithm you outlined. Consider the following example:
string = ababc%bc$
| | |(6:%bc$)|leaf
| | |(9:$)|leaf
"ab" appears twice in the first string, and so it gives a node with two leaves. The actual condition you should check is whether a node has one leaf containing the % separator and another leaf without the % symbol.