Restricted rotation distance between binary trees

Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rotations used to transform the trees are allowed to be only of two types. Restricted rotation distance is larger than rotation distance, since there are only two permissible locations to rotate, but is much easier to compute and estimate. We obtain linear upper and lower bounds for restricted rotation distance in terms of the number of interior nodes in the trees. Further, we describe a linear-time algorithm for estimating the restricted rotation distance between two trees and for finding a sequence of rotations which realizes that estimate. The methods use the metric properties of the group known as Thompson's group F. Key words: algorithms and data structures, binary trees, rotation distance

• Type: Journal
• Year: 2002
• Where: IPL
• Authors: Sean Cleary
• Keywords: Binary Trees, IPL 2002, Rotation Distance, Tree Shape