Alejandro Ruiz - Academia.edu (original) (raw)
Uploads
Papers by Alejandro Ruiz
Algorithms and Data Structures, 2005
Abstract. The restricted rotation distance dR(S, T) between two binary trees S, T of n vertices i... more Abstract. The restricted rotation distance dR(S, T) between two binary trees S, T of n vertices is the minimum number of rotations by which S can be transformed into T, where rotations can only take place at the root of the tree, or at the right child of the root. A sharp upper bound ...
Algorithms and Data Structures, 2005
Abstract. The restricted rotation distance dR(S, T) between two binary trees S, T of n vertices i... more Abstract. The restricted rotation distance dR(S, T) between two binary trees S, T of n vertices is the minimum number of rotations by which S can be transformed into T, where rotations can only take place at the root of the tree, or at the right child of the root. A sharp upper bound ...