Interface Trie<T>

The char code in parent that is associated with this trie, or -1 if trie has no parent.

true if the trie is a leaf and has a value.

The key that the leaf trie represents or null for a non-leaf trie.

The last child of the trie.

The list of remaining chars of the leaf's key.

The next trie in the linked list of all nodes in the trie.

The preceding trie or null if this trie is a root.

The previous trie in the linked list of all nodes in the trie.

The list of all leafs of this trie. A memoization mechanism, populated by trieSuggest and cleaned by trieSet and trieDelete.

The value set to the trie or undefined for a non-leaf trie. Use isLeaf to distinguish between leaf and non-leaf tries.