Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees

Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees

Show other versions (1)

We introduce gaps that are edges or external pointers in AVL trees such that the height difference between the subtrees rooted at their two endpoints is equal to 2. Using gaps we prove the Basic-Theorem that illustrates how the size of an AVL tree (and its subtrees) can be represented by a series of...

Full description

Bibliographic Details
Main Author: Mahdi Amani
Format: Article
Language:English
Published: Taylor & Francis Group 2018-04-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
avl tree
fibonacci tree
fibonacci-isomorphic tree
gaps in avl tree
encoding
Online Access:http://dx.doi.org/10.1016/j.akcej.2018.01.019

Internet

http://dx.doi.org/10.1016/j.akcej.2018.01.019

Similar Items