search - Ukkonen's suffix tree algorithm in plain English? - Stack Overflow: "The algorithm works in steps, from left to right. There is one step for every character of the string. Each step might involve more than one individual operation, but we will see (see the final observations at the end) that the total number of operations is O(n)."
'via Blog this'