Re: AVL Tree Implementation

[mfeldman@seas.gwu.edu (Michael Feldman)]

In article <52alk3$j0k@goanna.cs.rmit.edu.au>,
Richard A. O'Keefe <ok@goanna.cs.rmit.edu.au> wrote:
>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.
>
>	feldman		-- nothing
Hmmm - which distribution are you looking at? This is in mine:
(Feldman, Software Construction and Data Structures with Ada 95, AW 1996)

avl_trees_generic-height.adb
avl_trees_generic-insert.adb
avl_trees_generic-rotate_l.adb
avl_trees_generic-rotate_lr.adb
avl_trees_generic-rotate_r.adb

These are subunits intended to be incorporated into a modification of
the generic BST package:

binary_search_trees_generic-delete.adb
binary_search_trees_generic-findsmallest.adb
binary_search_trees_generic-insert.adb
binary_search_trees_generic-search.adb
binary_search_trees_generic-traverse_lnr.adb
binary_search_trees_generic.adb
binary_search_trees_generic.ads

No, I don;t provide a complete AVL package; the intention is that
the student will just modify the ordinary BST package with the new
AVL operators.

Textbooks don;t (and shouldn't) provide everything in ready-to-run
form; the student has to learn how to create components by adapting
other components.
>
>If you were using Ada in a data structures course, which books, and which
>associated package libraries, would you use?
>
Well, for me, this is of course a loaded question.:-)

Oh, OK, I'll answer it. I use the Feldman book.:-)

The home page for this book is at

http://heg-school.aw.com/cseng/authors/feldman/cs2-ada/cs2-ada.html

The program library is online there and also here at GW at

ftp://ftp.gwu.edu/pub/ada/courses/cs2code.zip (8+3 filenames)
ftp://ftp.gwu.edu/pub/ada/courses/cs2code.tar.Z (long filenames)

Mike Feldman