@kamilmielnik/trie
Version:
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
10 lines (9 loc) • 324 B
TypeScript
import type { Node } from '../types';
/**
* Inserts given `word` into given `node`.
*
* @param node - {@link Node} to insert the `word` to.
* @param word - Word to be inserted into `node`.
* @returns {@link Node} representing the end of the added word.
*/
export declare const add: (node: Node, word: string) => Node;