</B></PRE>Given an AVL tree and a position pos, 0.0 < pos <= 1.0,
return the item at that position.  If the tree is empty,
or if pos is out of range, NULL is returned.  The index
(counting from 1) of the returned item is
ceiling(pos * p->size).
<A NAME="avl_largest"></A><HR><PRE><B>void *avl_largest(Avl_node p);
</B></PRE>Return the largest (rightmost) item in an AVL tree.
<A NAME="avl_nth_item"></A><HR><PRE><B>void *avl_nth_item(Avl_node p, int n);
</B></PRE>Return the n-th item (counting from 1) in an AVL