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.
Binary Search Trees in C
License
spewspews/libbst
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
Binary Search Trees in C
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published