Affiliation:
1. ESI : Ecole Supérieure d'Informatique, Alger
Abstract
Abstract
A relaxation of AVL tree is proposed with no additional space. The original implementation of AVL trees uses two additional bits per node to control the tree balance and only three configurations are used to represent the possible balance factors. We exploit the fourth configuration to add extra nodes to the AVL tree. These nodes do not alter the rebalancing process. As a result, the new data structure, called the AVL-2 tree, is adjustable in height, making search, insert and delete operations faster or slower, depending on application needs. The height is at most equal to 2.88 lg2(N) where N is the tree size and lg2 is the base 2 logarithm. Unlike other data structures, an unsuccessful search can stop on an internal node and almost 80% of the data can be deleted with at most two pointer changes.
Publisher
Research Square Platform LLC
Reference28 articles.
1. G. M. Adel’son-Vel’skii and E. M. Landis. 1962. An algorithm for the organization of information. Sov. Math. Dokl. 3 (1962), 1259–1262.
2. Binary B-trees for virtual memory. In SIGFIDET Workshop on Data Description;Rudolf Bayer;Access and Control,1971
3. Rudolf Bayer. 1972. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica 1 (1972), 290–306.
4. Arne Andersson. 1993. Balanced search trees made simple. In Workshop on Algorithms and Data Structures, Vol. 709. 60–71.
5. Robert Sedgewick. 2008. Left-leaning Red-Black Trees. Retrieved from http://www.cs.princeton.edu/rs/talks/LLRB/LLRB.pdf.