From: dewar@schonberg.cs.nyu.edu (Robert Dewar)
Subject: Re: AVL Tree Implementation
Date: 1996/09/28
Date: 1996-09-28T00:00:00+00:00 [thread overview]
Message-ID: <dewar.843919802@schonberg> (raw)
teve asked
"Does anyone know if there exists an Ada implementation of AVL (balanced
B-Trees) tree routines (insert, delete, etc...). Thanx in advance."
That's very confused. B-Trees are always balanced (that's the whole point),
and AVL trees have nothing at all to do with B-Trees.
I think there are very few practical applications for AVL trees, the
algorithms are complex (they make challenging teaching material, some
of the rotations are quite tricky to understand, let alone program),
and there are almost always better approaches (such as Btrees!)
next reply other threads:[~1996-09-28 0:00 UTC|newest]
Thread overview: 11+ messages / expand[flat|nested] mbox.gz Atom feed top
1996-09-28 0:00 Robert Dewar [this message]
-- strict thread matches above, loose matches on Subject: below --
1996-09-24 0:00 AVL Tree Implementation Steve Kiraly
1996-09-25 0:00 ` Richard A. O'Keefe
1996-09-26 0:00 ` Michael Feldman
1996-10-01 0:00 ` Richard A. O'Keefe
1996-10-03 0:00 ` Michael Feldman
1996-10-06 0:00 ` Stanley Allen
1996-10-07 0:00 ` Richard A. O'Keefe
1996-10-16 0:00 ` John Howard
1996-09-27 0:00 ` Mats Weber
1996-09-30 0:00 ` Gerald.Kasner
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox