Go datastructures.

Algorithms and Data Structure For Go Applications

🌲Map implement: Black-Red Tree, AVL Tree

algo == common algorithm data structures for Golang.

A B+AVL tree is a Merkle tree that combines the properties of both AVL trees and B+Trees.

Package avl implements an AVL tree.

Just another implementation of AVL tree.

A simple and fast consistent hash-ring for go

Go`s generics AVL based sorted map

Package goavl provides a generic implementation of the AVL Tree data structure, in Go.

AVL tree, a balancing search tree

Implementation of a generic AVL Tree in Go. Intended to be used as a WASM module, though is perfectly functional as a standard Golang library.