On Feb 23, 2022, at 15:08:16, Charles Mills wrote:
>
> If you are writing in C++ then the B-tree is all implemented for you, and it
> is a d@mned fast implementation.
> '
That would be nice. I've played with the POSIX
tdelete, tfind, tsearch, twalk - manage a binary search tree
on various platforms and they appear not to balance the tree.
<https://pubs.opengroup.org/onlinepubs/9699919799/functions/tdelete.html#tag_16_609>-- gil
