home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #16 / NN_1992_16.iso / spool / comp / lang / c / 11788 < prev    next >
Encoding:
Internet Message Format  |  1992-07-30  |  1.2 KB
  1. Path: sparky!uunet!europa.asd.contel.com!darwin.sura.net!mips!swrinde!zaphod.mps.ohio-state.edu!caen!news.cs.indiana.edu!umn.edu!ulysses.cs.umn.edu!kencham
  2. From: kencham@ulysses.cs.umn.edu (Deepak)
  3. Newsgroups: comp.lang.c
  4. Subject: Re: Balancing Binary Search Trees
  5. Message-ID: <1992Jul30.223041.3092@news2.cis.umn.edu>
  6. Date: 30 Jul 92 22:30:41 GMT
  7. References: <1992Jul29.014821.2675@samba.oit.unc.edu> <29JUL199223244481@venus.tamu.edu>
  8. Sender: news@news2.cis.umn.edu (Usenet News Administration)
  9. Distribution: usa
  10. Organization: University of Minnesota
  11. Lines: 12
  12. Nntp-Posting-Host: ulysses.cs.umn.edu
  13.  
  14. Try using a Red-Black tree - they maintain the height of the binary tree balanced with a constant overhead. Cormen et. al. has a good discussion on the matter.
  15.  
  16. Hope that helps.
  17.  
  18. Deepak
  19. -- 
  20. ********************************************************************************
  21. *  Deepak R. Kenchammana-Hosekote                    *******     ******     *
  22. *  Dept. of CSci, University of Minnesota             ***  *** *** ***      *
  23. *  1:((612) 626-8396(o),(612) 339-8997(r))              ***   *****  ***      *
  24. *  kencham@ulysses.cs.umn.edu                        *****        *****     *
  25. ********************************************************************************
  26.