A Tale of Two Trees: New Analysis for AVL Tree and Binary Heap
Data Structures and Algorithms
2020-10-13 v1
Abstract
In this paper, we provide new insights and analysis for the two elementary tree-based data structures - the AVL tree and binary heap. We presented two simple properties that gives a more direct way of relating the size of an AVL tree and the Fibonacci recurrence to establish the AVL tree's logarithmic height. We then give a potential function-based analysis of the bottom-up heap construction to get a simpler and tight bound for its worst-case running-time.
Keywords
Cite
@article{arxiv.2010.04752,
title = {A Tale of Two Trees: New Analysis for AVL Tree and Binary Heap},
author = {Russel L. Villacarlos and Jaime M. Samaniego and Arian J. Jacildo and Maria Art Antonette D. Clariño},
journal= {arXiv preprint arXiv:2010.04752},
year = {2020}
}
Comments
4 pages