AVL balanced generic binary trees in Go

This page summarizes the projects mentioned and recommended in the original post on /r/golang

Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
  • btree

    AVL balanced generic binary trees in Go (by VictorLowther)

  • GoLLRB

    A Left-Leaning Red-Black (LLRB) implementation of balanced binary search trees for Google Go

    Go has generics now, and the API surface of the most popular btree implementations llrb and google don't quite match what I like from an iteration and sorting perspective. AVL has a pretty straightforward balancing model, and it turns out to be pretty performant for what I wind up doing a lot of the time.

  • InfluxDB

    Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

  • btree

    BTree provides a simple, ordered, in-memory data structure for Go programs.

    Go has generics now, and the API surface of the most popular btree implementations llrb and google don't quite match what I like from an iteration and sorting perspective. AVL has a pretty straightforward balancing model, and it turns out to be pretty performant for what I wind up doing a lot of the time.

  • graph

    A library for creating generic graph data structures and modifying, analyzing, and visualizing them.

    Nice! I've recently released a generic graph library as well and I like your iterator approach.

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a more popular project.

Suggest a related project

Related posts