Balanced Binary Search Trees
This is an implementation of both AVL and left leaning red black trees for Plan 9. It can be translated to Unix if -fplan9-extensions is used. For more information read the man page at man/2/bst.
This is an implementation of both AVL and left leaning red black trees for Plan 9. It can be translated to Unix if -fplan9-extensions is used. For more information read the man page at man/2/bst.