Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
-
Updated
Jan 26, 2025 - TypeScript
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
A simple app to visualize word unscrambling algorithm with the trie data structure.
Typescript implementation of trie/digital tree/radix tree/prefix tree/suffix tree.
A TypeScript Trie data structure for efficient word insertion, lookup, deletion, traversal, and autocomplete features.
Trie data structure implementation in javascript
A Double-array trie structure
Add a description, image, and links to the trie-data-structure topic page so that developers can more easily learn about it.
To associate your repository with the trie-data-structure topic, visit your repo's landing page and select "manage topics."