On Rotation Distance of Rank Bounded Trees

Anoop S. K. M., Jayalal Sarma

Computing the rotation distance between two binary trees with $n$ internal nodes efficiently (in $poly(n)$ time) is a long standing open question in the study of height balancing i…