User:Shlomif/Binary search tree implementations

This is a list of implementations of Binary search trees.

• GNU libavl - libavl version 1 is a GPLed collection containing an AVL tree, a threaded AVL tree, a right threaded AVL tree and a red-black tree. libavl version 2 is LGPLv3+ and contains all the combinations of an unbalanced BST, an AVL tree, a red-black tree, with plain, threaded, right-threaded and trees with parent pointers in a Literate programming style.
• The BSD Tree Macro - under sys/tree.h, these are C macros that generate red-black and splay trees. The comparison function does not accept a context/baton variable. 2-clause BSD license.
• The Literate Programs Wiki's Red Black in C implementation - MIT license.
• AVL tree by Benjamin Pollack - "An AVL tree implementation in C done for fun.". Unknown License and only uses integers for values. (Thanks to Eric Sink's post).
• libredblack - a reusable library implementing a Red Black tree in C. GNU Lesser General Public License version 2.1. Includes a utility called "rbgen" by Eric S. Raymond to implement associative arrays in C.
• kazlib - contains an implementation of a Red-black tree. Modified BSD licence. Comparison function does not accept a context/baton variable.
• libtree at github - implements an AVL tree, a splay tree, and a Red-Black tree under the LGPL v2.1. Comparison function does not accept a context/baton variable.
• cprops - AVL trees, Red-black trees, and splay trees in a recursive implementation.
• libx1f4l2 - a data structures library that features AVL, Red-Black, AA and RBST trees in several variations. GPLed.