Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| 2-3-4 Trees nrotem@johnbryce.co.il (Noam Rotem) (1997-12-17) |
| Re: 2-3-4 Trees bart@time.cirl.uoregon.edu (1997-12-19) |
| Re: 2-3-4 Trees hat@se-46.wpa.wtb.tue.nl (1997-12-19) |
| Re: 2-3-4 Trees dcox@iona.com (Declan Cox) (1997-12-23) |
| From: | bart@time.cirl.uoregon.edu (Barton C. Massey) |
| Newsgroups: | comp.compilers |
| Date: | 19 Dec 1997 00:17:20 -0500 |
| Organization: | CIRL |
| References: | 97-12-140 |
| Keywords: | theory |
Noam Rotem <nrotem@johnbryce.co.il> wrote:
> Can anyone send me
> a C/C++ / pseudo code / other implementation
> of 2-3-4 trees, or some
> theoretic general explanations?
In general, this is the book I look in first for such things
these days:
Thomas H. Cormen
Charles E. Leiserson
Ronald L. Rivest
_Introduction to Algorithms_
MIT Press/McGraw-Hill 1993
ISBN 0-262-03141-8 (MIT Press)
ISBN 0-07-013143-0 (McGraw-Hill)
On p. 365, it explains that a 2-3-4 tree is a B-tree with
minimum degree 2 and maximum degree 4 (thus every node has 2,
3, or 4 children). It also notes that "In practice, however,
much larger values of t [min/max degree] are typically used."
IMHO, this is indeed usually a good idea.
Bart Massey
bart@cirl.uoregon.edu
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.