Efficient, immutable and stack safe implementation of a Trie data structure in dart: autocomplete, text search, spell checking, strings and prefixes
-
Updated
Jan 22, 2024 - Dart
Efficient, immutable and stack safe implementation of a Trie data structure in dart: autocomplete, text search, spell checking, strings and prefixes
Python trie implementation, for educational purposes
The purpose of this project is to create a simple version of a distributed, fault-tolerant, Key-Value (KV) database (or store).
trie data structure
Add a description, image, and links to the trie-implementation topic page so that developers can more easily learn about it.
To associate your repository with the trie-implementation topic, visit your repo's landing page and select "manage topics."