baby is an OCaml library that offers several implementations of
balanced binary search trees.
Height-balanced and weight-balanced binary search trees are offered out of the box. Furthermore, to advanced users, the library offers a lightweight way of implementing other balancing strategies.
Type opam install baby.
In your dune file, add (libraries baby) to the description of
your library or executable.
To use baby's ready-made weight-balanced trees,
just use the functor Baby.W.Set.Make
instead of the usual Set.Make.
For more information, please see the documentation of the latest released version.