Bringing this back to Python a bit:
http://newcenturycomputers.net/projects/rbtree.html
http://pypi.python.org/pypi/bintrees/0.3.0
http://pypi.python.org/pypi/treap/0.995
Red-Black trees are supposed to be slower than treaps on average, but
they're also supposed to have a lower standard deviation
Hi,
Thanks for the answer. I copy the solution here:
According to wikipedia: "The original structure was invented in 1972
by Rudolf Bayer and named "symmetric binary B-tree," but acquired its
modern name in a paper in 1978 by Leonidas J. Guibas and Robert
Sedgewick."
Answer from Professor Guidas
On Wed, Apr 11, 2012 at 11:14 AM, Jabba Laci wrote:
> Hi,
>
> It's not really a Python-related question, sorry for that. Does anyone
> know why red-black trees got these colors in their names? Why not
> blue-orange for instance? I'm just curious.
http://programmers.stackexchange.com/questions/116
Hi,
It's not really a Python-related question, sorry for that. Does anyone
know why red-black trees got these colors in their names? Why not
blue-orange for instance? I'm just curious.
Thanks,
Laszlo
--
http://mail.python.org/mailman/listinfo/python-list
