> Well, you got license to a solid, lean red-black tree implementation?
> If so, drop it in! Same for a solid, lean AVL tree implementation.
> If starting from scratch I'd prefer the red-black tree because
> I know there are good algorithm descriptions out there; I haven't
> seen good pseudo-code for AVL trees yet.
The "Handbook of Algorithms and Data Structures" has vode for AVL insert
and left rotation, if you're interested. Not so for red-black trees.
MfG Kai