C library for balanced binary search tree storage. The library provides an API to create and use dynamic balanced binary search trees for arbitrary data. Data may be stored and retrieved by reference only. At present, AA trees and Splay trees are implemented. An implementation of Scapegoat trees is planned. Requires C99, no dependencies, platform independent. BSD style license.
Commercial Use
Modify
Distribute
Place Warranty
Hold Liable
Use Trademarks
Include Copyright
Include License
These details are provided for information only. No information here is legal advice and should not be used as such.