home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #19 / NN_1992_19.iso / spool / comp / programm / 2487 < prev    next >
Encoding:
Internet Message Format  |  1992-08-26  |  633 b 
  1. Path: sparky!uunet!ogicse!reed!orpheus
  2. From: orpheus@reed.edu (P. Hawthorne)
  3. Newsgroups: comp.programming
  4. Subject: Why Are Red-Black Trees Obscure?
  5. Message-ID: <1992Aug26.183817.7371@reed.edu>
  6. Date: 26 Aug 92 18:38:17 GMT
  7. Article-I.D.: reed.1992Aug26.183817.7371
  8. Organization: Reed College, Portland OR
  9. Lines: 6
  10.  
  11. Sedgewick, for the chapter on balanced trees in his book "Algorithms," uses
  12. the red-black tree. As a data structure, the red-black tree seems simple
  13. and well balanced. He convincingly suggests that they are better than AVL
  14. trees and yet, I've never seen them mentioned by anyone else. Why not?
  15.  
  16. Theus (orpheus@reed.edu)
  17.