AVL Tree III
AVL Trees are not, themselves, directly applicable to most file structures because like all strictly binary trees, they have too many levels--they are too deep.
AVL Trees, however, are important because they suggest that it is possible to define procedures that maintain height-balance.
AVL Trees’ search performance approximates that of a completely balanced tree. For a completely balanced tree, the worst-case search to find a key is log2(N+1). For an AVL Tree it is 1.44 Log2(N+2).