Simple Implementation of Modified Merkle Patricia Tries
A fixed Merkle Tree implementation in Go
B-tree implementation for Go
Fast, zero heap allocation Go Trie for runes or paths
A thread-safe, persistent Treap (tree + heap) for ordered key-value mapping and priority sorting.
慕课 liuyubobobo「玩转数据结构」课程的 Go 语言实现版本
A collection of useful, performant, and threadsafe Go datastructures.
Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).
generic container
Embedded key-value store for read-heavy workloads written in Go
[WIP] Implementation of HAT-trie in Go
Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci