A prefix tree (trie) implementation in go
-
Updated
Jun 27, 2023 - Go
A prefix tree (trie) implementation in go
A serializable compact prefix tree (also known as Radix tree or Patricia tree or space-optimized trie) implementation in JavaScript.
Realization of the prefix tree
Bartez is a crossword generator written in Python using networkx
Prefix Trie data structure with Pattern Matching, in C++
data structure libraries for Java
Add a description, image, and links to the prefix-trie topic page so that developers can more easily learn about it.
To associate your repository with the prefix-trie topic, visit your repo's landing page and select "manage topics."