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

AVL Tree

Red-black tree written in Go

Red-black tree data structure implemented in Go

B+ Tree, AVL Tree, Red-Black Tree golang implementation

This is a go implementation of a tree map using red-black tree.

this library contains most popular collections implementations

Red-Black Tree implementation in Go

Package rbtree implements a red–black tree.

This Go package provides an implementation of ranking-list based on red-black 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.

Implementation of data structures in GO.

consistent hashing paper implementation using Red Black tree