github.com/olexiykhokhlov/avltree (go): AVLTree are associative containers that store elements formed by a combination of a key value and a mapped value, following a specific order. In a AVLTree, the key values are generally used to sort and uniquely identify the elements, while the mapped values store the content associated to this key. The types of key and mapped value may differ. Internally, the elements in a AVLTree are always sorted by its key following a specific strict weak ordering criterion indicated by its internal comparison object (of type Comparator). AVLTree containers are generally slower than go map container to access individual elements by their key, but they allow the direct iteration on subsets based on their order.
Keywords: avl|avl-tree|avl-tree-code|avl-tree-implementations|avltrees|binary-search-tree|generic|go|go-generics|go118|golang|non-recursive|sorted|sorted-map|sorted-sets|tree|tree-structure