go-adaptive-radix-tree
by plar
Gopushed almost 2 years ago
Adaptive Radix Trees implemented in Go
AI summary
Radix Tree
A data structure implementation that combines the efficiency of hash tables with the sorted order of tries, optimized for fast search and insertion operations.
- stars
- 375
- forks
- 56
- watching
- 9
- awesome lists
- 2
Featured in 2 awesome lists
Each link jumps to the spot where the list mentions go-adaptive-radix-tree.