GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more

Generic sorted map for Go with red-black tree under the hood

The go-set package provides generic Set implementations for Go, including HashSet for types with a Hash() function and TreeSet for orderable data

Orderbook implementation in go with red black tree

GoDS-Generic (Go Generic Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more

Algorithms and Data Structure For Go Applications

Generic data structure using parameterized types in Golang.

Implementation of data structures in GO.

consistent hashing paper implementation using Red Black tree

🌲Map implement: Black-Red Tree, AVL Tree

Typesafe Go Data Structure with generics, rich interfaces, functional transformation, and more...

Red-Black Tree Implementation

golang red-black tree

Basic data structures and operations written in Go, such as trie, bloom filter union&find etc.

Red–black tree

🌴 LLRB-Tree provides a simple, ordered, in-memory data structure for Go programs

Package rbtree provides a red-black tree implementation.

Red/Black tree on-disk implementation with go

Red-black tree written in Go

AVL Tree