Red-Black-trees
Red-Black-trees is an implementation of red-black-trees (a data structure). It comprises the following functions

  • Insertion of an item

  • Finding an item by key

  • Deleting a node

It can be downloaded as *Program B* on this page.

There is a source repository with some small fixes available at: https://github.com/jwiegley/red-black