@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';
/**
* Removes given word from given {@link Node} if it exists.
*
* @param node - {@link Node} to remove word from.
* @param word - Word to be removed.
* @returns true if the word was removed, false otherwise.
*/
export declare const remove: (node: Node, word: string) => boolean;