Un Albero rosso / nero è un modo per implementare un albero di ricerca binario bilanciato. I principi alla base di come funziona hanno senso per me, ma i colori scelti non lo fanno. Perché il rosso e il nero, al contrario di qualsiasi altra coppia di colori o di attributi in generale? Quando sento "rosso e nero", le prime cose che mi vengono in mente sono le scacchiere e Les Misérables, nessuno dei due che sembra particolarmente applicabile in questo contesto.
EDIT : risposta del Professor Guibas:
from Leonidas Guibas [email protected] 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.
Credo che il termine sia apparso per la prima volta in " Un quadro dicromatico per alberi equilibrati " di Leonidas J. Guibas e Robert Sedgewick del 1978.
In Coursera, BST rosso-nero (2012) , Robert Sedgewick dice questo:
A lot of people ask why did we use the name red–black. Well, we invented this data structure, this way of looking at balanced trees, at Xerox PARC which was the home of the personal computer and many other innovations that we live with today entering[sic] graphic user interfaces, ethernet and object-oriented programmings[sic] and many other things. But one of the things that was invented there was laser printing and we were very excited to have nearby color laser printer that could print things out in color and out of the colors the red looked the best. So, that’s why we picked the color red to distinguish red links, the types of links, in three nodes. So, that’s an answer to the question for people that have been asking.
Leggi altre domande sui tag history data-structures