Algorithms and Data Structures

DOI10.1007/11534273MaRDI QIDQ5394233zbMATH OpenOpenAlexFDO

Authors Alejandro Almeida Ruiz, Fabrizio Luccio, Antonio Mesa Enríquez, L. Pagli

Publication date 25 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11534273

zbMATH Keywords

AVL treeBinary treeData structuresDesign of algorithmsRebalancingRotationRotation distanceSearch tree

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• \(k\)-restricted rotation distance between binary trees
• Restricted rotation distance between k-ary trees
• Bounding restricted rotation distance
• Restricted rotation distance between binary trees.
• Distributions of restricted rotation distances

Cited in

(7)

• A metric for rooted trees with unlabeled vertices based on nested parentheses
• Restricted rotation distance between k-ary trees
• Efficient lower and upper bounds of the diagonal-flip distance between triangulations
• \(k\)-restricted rotation distance between binary trees
• On the rotation distance between binary trees
• Refined upper bounds for right-arm rotation distances
• Weak associativity and restricted rotation

This page was built for publication: Algorithms and Data Structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5394233)