The go-set package provides generic Set implementations for Go, including HashSet for types with a Hash() function and TreeSet for orderable data
-
Updated
Nov 11, 2024 - Go
The go-set package provides generic Set implementations for Go, including HashSet for types with a Hash() function and TreeSet for orderable data
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
this library contains most popular collections implementations
Red-black tree data structure implemented in Go
🌴 LLRB-Tree provides a simple, ordered, in-memory data structure for Go programs
Red/Black tree on-disk implementation with go
GoDS-Generic (Go Generic Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
This is a go implementation of a tree map using red-black tree.
Typesafe Go Data Structure with generics, rich interfaces, functional transformation, and more...
B+ Tree, AVL Tree, Red-Black Tree golang implementation
This Go package provides an implementation of ranking-list based on red-black tree
Generic data structure using parameterized types in Golang.
Generic sorted map for Go with red-black tree under the hood
Package rbtree provides a red-black tree implementation.
🌲Map implement: Black-Red Tree, AVL Tree
Basic data structures and operations written in Go, such as trie, bloom filter union&find etc.
Package rbtree implements a red–black tree.
Add a description, image, and links to the red-black-tree topic page so that developers can more easily learn about it.
To associate your repository with the red-black-tree topic, visit your repo's landing page and select "manage topics."