Tree

http://t-t-travails.blogspot.hk/2008/07/treaps-versus-red-black-trees.html

• rb_new: Left-leaning red-black trees.
• rb_old: Standard red-black trees.
• RB: Standard red-black trees, as implemented by the *BSD sys/tree.h.
• trp_hash: Treaps, with priorities computed via pointer hashing.
• trp_prng: Treaps, with priorities computed via pseudo-random number generation

http://adtinfo.org/

implment a two-pointer red-black tree, a three-pointer red-black tree, an AVL tree and a unbalanced binary search tree

A three-pointer red-black tree and a splay tree. http://www.freebsd.org/cgi/cvsweb.cgi/src/sys/sys/tree.h

http://www.darkridge.com/~jpr5/mirror/alg/node21.html

It implements a two-pointer recursive red-black tree (all the other binary search trees are implemented without recursion).

http://sglib.sourceforge.net/

http://attractivechaos.awardspace.com/kbtree.h.html

http://adtinfo.org/

http://attractivechaos.wordpress.com/2008/10/07/another-look-at-my-old-benchmark/

http://lh3lh3.users.sourceforge.net/udb.shtml

k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space.¹

http://spatial.sourceforge.net/

http://libkdtree.alioth.debian.org/

http://nbviewer.ipython.org/url/jakevdp.github.com/downloads/notebooks/TreeBench.ipynb