avl

avl

Generic AVL Tree implementation for golang

features

• simple API
• generic
• range-iter support
• zero-dependency
• zero-alloc
• 100% test-covered

example

package main

import (
    "fmt"

    "github.com/s0rg/avl"
)

func main() {
    tree := avl.New[int, string]()

    tree.Add(4, "four")
    tree.Add(2, "two")
    tree.Add(5, "five")
    tree.Add(1, "one")
    tree.Add(3, "three")

    tree.Del(1)

    if val, ok := tree.Get(2); ok {
        fmt.Println("value of 2:", val)
    }

    for k, v := range tree.Iter {
        fmt.Println("key", k, "value", v)
    }
}

benchmarks

cpu: AMD Ryzen 5 5500U with Radeon Graphics
BenchmarkTree/AddInc-12             6420224       185.7 ns/op        47 B/op          0 allocs/op
BenchmarkTree/AddDec-12             7155193       209.3 ns/op        47 B/op          0 allocs/op
BenchmarkTree/Get-12                22292175           49.07 ns/op        0 B/op          0 allocs/op
BenchmarkTree/Del-12                592457149           2.018 ns/op       0 B/op          0 allocs/op
PASS
ok      github.com/s0rg/avl 7.579s

license

MIT