It can also be described as the shortest path distance in a "rotation graph", a graph that has a vertex for each binary tree on a given left-to-right sequence of nodes and an edge for each rotation between two trees.