home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #19 / NN_1992_19.iso / spool / comp / programm / 2497 < prev    next >
Encoding:
Internet Message Format  |  1992-08-27  |  817 b 
  1. Path: sparky!uunet!gatech!concert!duke!psu
  2. From: psu@cs.duke.edu (Peter Su)
  3. Newsgroups: comp.programming
  4. Subject: Re: Why Are Red-Black Trees Obscure?
  5. Message-ID: <PSU.92Aug27104235@ptero.cs.duke.edu>
  6. Date: 27 Aug 92 14:42:35 GMT
  7. References: <1992Aug26.183817.7371@reed.edu> <1992Aug27.115551.7958@daimi.aau.dk>
  8. Sender: news@duke.cs.duke.edu
  9. Organization: Duke University CS Dept., Durham, NC
  10. Lines: 14
  11. Nntp-Posting-Host: ptero.cs.duke.edu
  12. In-reply-to: protonen@daimi.aau.dk's message of 27 Aug 92 11:55:51 GMT
  13.  
  14. Pet Peeve Time:
  15.  
  16. All of the following are easier than AVL trees:
  17.  
  18. splay trees, red-black trees, skip-lists, randomized binary trees,
  19. etc.
  20.  
  21. Why do people insist on teaching AVL trees?
  22.  
  23. Pete
  24. --
  25. Department of Computer Science, Duke University, Durham, NC 27706
  26. Internet:    psu@cs.duke.edu
  27. UUCP:        mcnc!duke!psu
  28.