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=0.2 required=5.0 tests=BAYES_00,INVALID_MSGID,
	REPLYTO_WITHOUT_TO_CC 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: Gerald.Kasner@Physik.Uni-Magdeburg.de
Subject: Re: AVL Tree Implementation
Date: 1996/09/30
Message-ID: <52o08r$h80@petrus.cs.Uni-Magdeburg.DE>#1/1
X-Deja-AN: 186201123
distribution: world
references: <steve_kiraly-240996152446@kiraly.rc.trw.com>
organization: AVL-trees
reply-to: steve_kiraly@rc.trw.com (Steve Kiraly)
newsgroups: comp.lang.ada
Date: 1996-09-30T00:00:00+00:00
List-Id: <comp.lang.ada>


In <steve_kiraly-240996152446@kiraly.rc.trw.com>, steve_kiraly@rc.trw.com (Steve Kiraly) writes:
>Hi y'all,
>Does anyone know if there exists an Ada implementation of AVL (balanced
>B-Trees) tree routines (insert, delete, etc...).  Thanx in advance.
>Steve

I wrote a generic package for this stuff - mostly a translation of the 
corresponding routines in N. Wirth's textbook "Algorithmen und Daten-
strukturen mit Modula-2". This textbook is in German but should 
be available in in English too.

Stubbs & Webre promised to make the sources of their textbook "Data 
Structures with Abstract Data Types and Ada" free available. I tried 
several times the address COMPSCI.PWS@APPLELINK.APPLE.COM , but
it seems that this does not exists.

If you have interest I'll send my sources via E-Mail.

-Gerald