What's the best Red Black Tree implementation for Python with an opensource license?
I started out looking at http://newcenturycomputers.net/projects/rbtree.htmlbecause it was pretty high in Google and had the operators I wanted, but it gets very slow at about half a million elements. I've been discussing this with a C programmer who believes that Red Black Trees should perform very similarly to an AVL tree, but that's not at all what I'm getting with the newcenturycomputers implementation. I'd prefer something that looks like a dictionary, runs on 2.x and 3.x, and passes pylint, but if that's not yet available I might make it so. This is part of a comparison of Python tree types I did a while back... I've been thinking that I've given Red Black Trees short shrift by using a poor implementation. The comparison so far is at http://stromberg.dnsalias.org/~strombrg/python-tree-and-heap-comparison/ Thanks!
-- http://mail.python.org/mailman/listinfo/python-list
