Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
438599 | Theoretical Computer Science | 2007 | 5 Pages |
Abstract
Rotation distances measure the difference in shape in rooted binary trees. We construct sharp bounds on maximal right-arm rotation distance and restricted right-arm rotation distance for trees of size n. These bounds sharpen the results of Cleary and Taback and incorporate the lengths of the right side of the trees to improve the bounds.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics