home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!malgudi.oar.net!caen!batcomputer!munnari.oz.au!bruce.cs.monash.edu.au!goanna!minyos.xx.rmit.oz.au!kjb
- From: kjb@cgl.citri.edu.au (Kendall Bennett)
- Newsgroups: comp.lang.c
- Subject: Re: Balancing Binary Search Trees
- Message-ID: <kjb.712461397@godzilla.cgl.citri.edu.au>
- Date: 30 Jul 92 01:56:37 GMT
- References: <1992Jul29.014821.2675@samba.oit.unc.edu>
- Sender: usenet@minyos.xx.rmit.oz.au (Njuiz noveles nova newes)
- Organization: RMIT Advanced Computer Graphics Centre, CITRI, Melbourne
- Lines: 31
-
- Alan.Tai@bbs.oit.unc.edu (Alan Tai) writes:
-
- >I currently have a binary search tree to store an alphabetized list of
- >words, but would like it to be optimized for speed of retrieval. Could
- >someone please post some example code for balancing binary trees, or
- >even suggest a book that might have this code. So far, I haven't come
- >across any texts that have this, though. Thanks!
-
- This one is as widely published as the binary tree algorithm. There are
- a number of different algortithms to do this, AVL trees, Red Black trees
- and just recently Splay Trees. I can't remember the name of paper on splay
- trees by Sleator and Tarjan, but I think I saw some code for them in the
- GNU libg++ archive.
-
- Anyway, you can get C code to implement AVL tree from my 'ctools10.tar.Z'
- archive (.zip version is on simtel20 and garbo), which can be ftp'ed from
-
- godzilla.cgl.rmit.oz.au
-
- as:
-
- kjb/ctools10.tar.Z
-
- +------------------------------------------+-------------------------------+
- | Kendall Bennett, | Internet: |
- | Advanced Computer Graphics Centre, | kjb@godzilla.cgl.citri.edu.au |
- | Royal Melbourne Institute of Technology, | rcskb@minyos.xx.rmit.oz.au |
- | Victoria, AUSTRALIA. | |
- +------------------------------------------+-------------------------------+
- | CoSysop (Bossman), PC Connection Australia: +61 3 688 0909 |
- +--------------------------------------------------------------------------+
-