Typescript implementation of trie/digital tree/radix tree/prefix tree/suffix tree.
-
Updated
Nov 18, 2023 - TypeScript
Typescript implementation of trie/digital tree/radix tree/prefix tree/suffix tree.
A tiny substring search module using an uncompressed suffix tree. Speed should be ok, but potential to be optimized massively for space.
A tiny substring search module using an uncompressed suffix tree. Speed should be ok, but potential to be optimized massively for space.
Implementing of the prefix and suffix trees, autocomplete service and full text search engine based on them.
Data structures implementation & visualization
Add a description, image, and links to the suffix-tree topic page so that developers can more easily learn about it.
To associate your repository with the suffix-tree topic, visit your repo's landing page and select "manage topics."