Does anyone know the reason for the statement below? Or is there a better website to ask this type of question? Any pointer would be appreciated.

> 
> If a pattern occurs in a text (of length n) k times, the search of the pattern for all those k times in the suffix tree of that text would cost O(n+k).
> 
> 
>