Add comment about the complexity of the build method

mgechev · mgechev · commit 4010a698d89a · 2014-11-17T15:49:22.000+02:00
diff --git a/src/data-structures/suffix-tree.js b/src/data-structures/suffix-tree.js
@@ -56,6 +56,7 @@ SuffixTree.prototype.addNode = (function () {
   };
 }());
 
+// O(n^2) or even O(n^3) because of maxPrefix
 SuffixTree.prototype.build = function (string) {
   this.root.value = string;
   for (var i = 1; i < string.length; i += 1) {
