In this paper, we use four types of restricted rotations for tree transformation proposed by Wu et al [13] and develop their algorithm to transform weight sequences between any two binary trees. Converting a source tree to a destination tree, it is not necessary to rotate each pair of corresponding nodes whose weights are the same. From the proposed algorithm, we can also obtain an upper bound of n - 1 between any two binary trees.
展开▼
