The performance that I'm discussing is lookup performance, not insert/delete performance.<P>I believe that AVL trees still give you O (log n) for modifications to the tree, even with all the tree ...