GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
-
Updated
Jun 21, 2024 - Go
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
The go-set package provides generic Set implementations for Go, including HashSet for types with a Hash() function and TreeSet for orderable data
GoDS-Generic (Go Generic Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
Generic sorted map for Go with red-black tree under the hood
Generic data structure using parameterized types in Golang.
Orderbook implementation in go with red black tree
Basic data structures and operations written in Go, such as trie, bloom filter union&find etc.
🌲Map implement: Black-Red Tree, AVL Tree
Typesafe Go Data Structure with generics, rich interfaces, functional transformation, and more...
Implementation of data structures in GO.
Package rbtree provides a red-black tree implementation.
Red-Black Tree Implementation
consistent hashing paper implementation using Red Black tree
Implementation of Binary Search Tree algorithms in Go
🌴 LLRB-Tree provides a simple, ordered, in-memory data structure for Go programs
This is a go implementation of a tree map using red-black tree.
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."