From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,5b61ae0cff785f8b
X-Google-Attributes: gid103376,public
From: Mats.Weber@elca-matrix.ch (Mats Weber)
Subject: Re: AVL Tree Implementation
Date: 1996/09/27
Message-ID: <Mats.Weber-2709961837180001@mlma27.elca-matrix.ch>#1/1
X-Deja-AN: 185748393
references: <steve_kiraly-240996152446@kiraly.rc.trw.com>
organization: ELCA Matrix SA
newsgroups: comp.lang.ada
Date: 1996-09-27T00:00:00+00:00
List-Id: <comp.lang.ada>


>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