adaptive radix tree (a.k.a prefix tree or compact trie)
MIT License
Generic sorted map for Go with red-black tree under the hood
A collection of generic data structures written in Go.
a lock-free radix tree implementation for golang
Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
graph and tree algorithms in Go
B-tree implementation for Go
Data structure and algorithm library for go, designed to provide functions similar to C++ STL
Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).
A simple and serializable radix tree implementation in Go/Golang.
An Adaptive Radix Tree (ART) implementation in Go