red-black tree data structure

[Jabba Laci]

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:

"    from Leonidas Guibas guibas at cs.stanford.edu to of the "Red-Black"
term mailed-by cs.stanford.edu hide details 16:16 (0 minutes ago)

    we had red and black pens for drawing the trees."

Laszlo

On Wed, Apr 11, 2012 at 19:39, Ian Kelly <ian.g.kelly at gmail.com> wrote:
> On Wed, Apr 11, 2012 at 11:14 AM, Jabba Laci <jabba.laci at gmail.com> 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/116614/where-does-the-term-red-black-tree-come-from