5 research outputs found
A tight upper bound for the path length of AVL trees
Get PDFAbstractWe prove that the internal path length of an AVL tree of size N is bounded from above by 1.4404N(log2 N-log2log2N)+O(N) and show that this bound is achieved by an infinite family of AVL trees, each tree of which is not of maximal height. These results carry over to the comparison cost of brother trees
AIFB Jahresbericht. Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe (TH). 1986
Get PDFJahresbericht. Institut fuer Angewandte Informatik und Formale Beschreibungsverfahren, Universitaet Karlsruhe (TH). 1986
Get PDF
