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

DOI10.1016/j.akcej.2018.01.019zbMath1390.05042OpenAlexW2790513523MaRDI QIDQ1643905

Mahdi Amani

Publication date: 20 June 2018

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2018.01.019

zbMATH Keywords

encodingAVL treeFibonacci treeFibonacci-isomorphic treegaps in AVL tree

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order ⋮ Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ranking and unranking of non-regular trees with a prescribed branching sequence
• A new algorithm for solving the tree isomorphism problem
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• New terminology and results for AVL trees
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Ranking and unranking algorithms for loopless generation of t-ary trees
• An Amortized Analysis of Insertions into AVL-Trees
• On the generation of binary trees inA-order
• Binary Search Trees of Bounded Balance
• Amortized rotation cost in AVL trees

This page was built for publication: Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees