Trie for suffix, construction in O(n) JavaScript

Trie for Suffix.js

function SuffixTrieNode() {
    this.children = {};
    this.link = null;
}

SuffixTrieNode.prototype.addLink = function(c, v) {
    this.children[c] = v;
};

function SuffixTrie(s) {
    this.root = new SuffixTrieNode();
    this.remainder = 0;
    this.longest = this.root;
    for (var i = 0; i < s.length; i++) {
        this.insert(s.charAt(i));
    }
}

SuffixTrie.prototype.search = function(s) {
    var node = this.root;
    for (var i = 0; i < s.length; i++) {
        if (node.children.hasOwnProperty(s.charAt(i)))
            node = node.children[s.charAt(i)];
        else
            return false;
    }
    return true;
};

SuffixTrie.prototype.searchSuffix = function(s) {

}

SuffixTrie.prototype.longestRepeat = function() {

}



SuffixTrie.prototype.insert = function(ch) {
    var current = this.longest;
    var previous = null;
    //var ch = s.charAt(i);
    while (current !== null &&  !current.children.hasOwnProperty(ch)) {
        var node = new SuffixTrieNode();
        current.addLink(ch, node);
        if (previous !== null) {
            previous.link = node;
        }
        previous = node;
        current = current.link;
    }
    if (current === null) {
        previous.link = this.root;
    } else {
        previous.link = current.children[ch];
    }
    this.longest = this.longest.children[ch];
};