AVL tree code

[nathan@akbar.teleos.com]

I want to efficiently maintain a fairly large set (>3000 elements) of
sorted values, allowing for the operations insert, delete, min,
member, and next-member (i.e. (next-member (min avl)) is the second
smallest element).  From a quick review of my algorithms text book it
looks like AVL-Trees are the ticket.  Has anyone out there implemented
such or have code that provides similar functionality?  (AVL-Trees
allow all of the listed functions in time proportional to the log of
the number of elements in the tree)

Nathan Wilson
Teleos Research
nathan@teleos.com