Rotation Distance between Two Binary Trees

Abstract

There are a number of ways to measure the difference in shape between two rooted binary trees with the same number of leaves. Pallo introduced a left weight sequence, which is a sequence of positive integers, to characterize the structure of a binary tree. By applying the AVL tree transformation on binary trees, we develop an algorithm to transform the left weight sequences between two binary trees efficiently.