🎄 Generic trie data structure (prefix tree) in Rust, with functions to search for common prefixes and postfixes
-
Updated
Mar 2, 2024 - Rust
🎄 Generic trie data structure (prefix tree) in Rust, with functions to search for common prefixes and postfixes
Algorithm to find the longest matching prefix for a binary string using a binary trie
This is a Rust-based autocomplete and search tool that runs client-side using WebAssembly. It provides functionality for autocomplete and retrieval of content based on search queries.
trie data 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."