A Developed Restricted Rotation for Binary Trees Transformation

摘要：

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.

关键词： Algorithms Binary trees Rotations Tree transformation

作者: Ro-Yu Wu Jou–Ming Chang Chir-Ho Chang

作者单位: Department of Industrial Management, Lunghwa University of Science and Technology, Taoyuan, Taiwan, Department of Information Management, National Taipei College of Business, Taipei, Taiwan, ROC

会议类型: 国际会议

会议名称: 2009 Ninth International Conference on Hybrid Intelligent Systems(第九届混合智能系统国际会议 HIS 2009)

会议地点: 沈阳

会议语种:英文

页码: 1-6

在线出版日期: 2009-08-12（万方平台首次上网日期，不代表论文的发表时间）