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.1 required=5.0 tests=BAYES_05,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: dewar@schonberg.cs.nyu.edu (Robert Dewar)
Subject: Re: AVL Tree Implementation
Date: 1996/09/28
Message-ID: <dewar.843919802@schonberg>#1/1
X-Deja-AN: 185843845
organization: New York University
newsgroups: comp.lang.ada
Date: 1996-09-28T00:00:00+00:00
List-Id: <comp.lang.ada>


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!)