A Trie data structure which can be searched using wild characters.
-
Updated
Mar 26, 2017 - Java
A Trie data structure which can be searched using wild characters.
A Java Library that uses Trie structure to retrieve a K most recurring words
Add a description, image, and links to the trie-node topic page so that developers can more easily learn about it.
To associate your repository with the trie-node topic, visit your repo's landing page and select "manage topics."