any one here has any knowledge concerning suffix trees and
" The size of STrie(S) is linear in the number of substrings of S. S has at most (n + 1)^2 substrings. Thus, the size of STree(S) is O(n^2)."
any one here has any knowledge concerning suffix trees and tries … need help about how the f!#$!k ” The size of STrie(S) is linear in the number of substrings of S. S has at most (n + 1)^2 substrings. Thus, the size of STree(S) is O(n^2).”