Re:What should a self-taught programmer with no degree learn...
by michael_dorfman on Friday December 17, 2010 @07:08AM
(#2015984)
According to the indices, Red-Black trees are mentioned once, on page 477 of Volume 3.
[ Parent
| on HN ]
Re:What should a self-taught programmer with no degree learn...
by gjm11 on Friday December 17, 2010 @07:35PM
(#2018478)
And here is the complete text of what Knuth says about red-black trees.
"Elaboration of these ideas [2-3 trees, and a way of representing them as binary trees -- gjm] has led to many additional flavors of balanced trees, most notably the red-black trees, also called symmetric binary B-trees or half-balanced trees" ... followed by a list of references to places where these other sorts of tree, including red-black trees, are discussed.
So, indeed, you wouldn't turn to Knuth for "red-black tree magic".