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: ok@goanna.cs.rmit.edu.au (Richard A. O'Keefe) Subject: Re: AVL Tree Implementation Date: 1996/09/25 Message-ID: <52alk3$j0k@goanna.cs.rmit.edu.au>#1/1 X-Deja-AN: 185205822 references: organization: Comp Sci, RMIT, Melbourne, Australia nntp-posting-user: ok newsgroups: comp.lang.ada Date: 1996-09-25T00:00:00+00:00 List-Id: steve_kiraly@rc.trw.com (Steve Kiraly) writes: >Does anyone know if there exists an Ada implementation of AVL (balanced >B-Trees) tree routines (insert, delete, etc...). Thanx in advance. Yes. y% wc avl.ad? 438 1299 8661 avl.adb 116 705 4300 avl.ads That's mine. I just surveyed our local /public/ada/data_structures directory: beidler -- nothing booch -- type AVL_Node declared in bc_support_nodes.ads -- but not yet used anywhere feldman -- nothing rational -- nothing stubbs -- nothing Gosh. I thought we _must_ have it. If you were using Ada in a data structures course, which books, and which associated package libraries, would you use? -- Australian citizen since 14 August 1996. *Now* I can vote the xxxs out! Richard A. O'Keefe; http://www.cs.rmit.edu.au/%7Eok; RMIT Comp.Sci.