Simple implementation of compressed radix trees in Go.
A radix tree is a space-optimized/compressed version of a standard trie, with every node that is a single child being merged with their parent. Unlike regular tries, the edges of a radix tree can hold strings, not only single characters.
Wikipedia article about Radix trees