Time Complexity of building a Suffix Tree
https://stackoverflow.com/questions/7451942/time-complexity-of-building-a-suffix-tree Your intuition behind why the algorithm should be Θ(n2) is a good one, but most suffix trees are designed in a way that eliminates the need for this time…