Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!sharkey!atanasoff!hascall
From: hascall@atanasoff.cs.iastate.edu (John Hascall)
Newsgroups: comp.lang.c
Subject: Re: a tree question
Keywords: search tree
Message-ID: <1356@atanasoff.cs.iastate.edu>
Date: 22 Aug 89 23:45:22 GMT
References: <421@ohs.UUCP> <1074@taurus.BITNET>
Reply-To: hascall@atanasoff.cs.iastate.edu.UUCP (John Hascall)
Organization: Iowa State Univ. Computation Center
Lines: 19

In article 1074 amirben%math.tau.ac.il@CUNYVM.CUNY.EDU (Ben-amram Amir) writes:
}In article 421 bhil@ohs.UUCP (Brian T. Hill) writes:

}>Does anyone have a good alternative to the AVL method of balancing...
 
}I don't know if you can save a lot beyond AVL trees, but you may find
}one of the following methods more elegant/easy-to-implement:
 
}2-3 trees --- Aho, Hopcroft and Ullman, The Design and Analysis of
}              Computer Algorithms (Addison-Wesley 74).
 
   BTW, 2-3 trees are really B-trees of order 3.
   They, along with several other trees, are discussed in Knuth V3.
 
   Since this is comp.lang.c :-)  Does anyone know of any good "Algortithm"
   books where the examples are in C?

John Hascall