search-trie
A simple trie structure to perform prefix search on texts in O(n) time, where n - number of characters in searched word. > Trie is a basic Tree structure, also known as [prefix tree](https://en.wikipedia.org/wiki/Trie) Super simple, Super fast, super comp
Activity
- Latest release
- 2y ago
- Total releases
- 6
- Cadence
- ~1.0 years
- Last 12 months
- 0
Details
- License
- MIT
- First release
- Feb 11, 2018
Releases
| Version | Released | |
|---|---|---|
3.0.0
major
| ||
2.1.0
minor
| ||
2.0.1
patch
| ||
2.0.0
major
| ||
1.1.0
minor
| ||
1.0.0
initial
|