A direct algorithm for restricted rotation distance

  • Authors:
  • Joan M. Lucas

  • Affiliations:
  • Department of Computer Science, State University of New York, College at Brockport, 350 New Campus Drive, Brockport, NY

  • Venue:
  • Information Processing Letters
  • Year:
  • 2004

Quantified Score

Hi-index 0.89

Visualization

Abstract

In this paper we present a concise O(n) implementation of Cleary's algorithm for generating a sequence of restricted rotations between any two binary trees. The algorithm is described directly in terms of the binary trees, without using any intermediate representation.