From: Mats.Weber@elca-matrix.ch (Mats Weber)
Subject: Re: AVL Tree Implementation
Date: 1996/09/27
Date: 1996-09-27T00:00:00+00:00 [thread overview]
Message-ID: <Mats.Weber-2709961837180001@mlma27.elca-matrix.ch> (raw)
In-Reply-To: steve_kiraly-240996152446@kiraly.rc.trw.com
>Does anyone know if there exists an Ada implementation of AVL (balanced
>B-Trees) tree routines (insert, delete, etc...). Thanx in advance.
Here is the implementation I have made, based on Wirth's book "Algorithms
+ Data Structures = Programs".
--Mats
begin 644 bags_full.ada.gz
<uuencoded_portion_removed>
E;1(AD6O'=%F;9=M!>DJ)7CR9=?!)"7D_[&#G_P$PWC#`"=\``'51
`
end
next prev parent reply other threads:[~1996-09-27 0:00 UTC|newest]
Thread overview: 11+ messages / expand[flat|nested] mbox.gz Atom feed top
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 [this message]
1996-09-30 0:00 ` Gerald.Kasner
-- strict thread matches above, loose matches on Subject: below --
1996-09-28 0:00 Robert Dewar
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox