二叉树变换的一种发展的受限旋转

Ro-Yu Wu, Jou-Ming Chang, Chir-Ho Chang
{"title":"二叉树变换的一种发展的受限旋转","authors":"Ro-Yu Wu, Jou-Ming Chang, Chir-Ho Chang","doi":"10.1109/HIS.2009.23","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Developed Restricted Rotation for Binary Trees Transformation\",\"authors\":\"Ro-Yu Wu, Jou-Ming Chang, Chir-Ho Chang\",\"doi\":\"10.1109/HIS.2009.23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":414085,\"journal\":{\"name\":\"2009 Ninth International Conference on Hybrid Intelligent Systems\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Ninth International Conference on Hybrid Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HIS.2009.23\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Ninth International Conference on Hybrid Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HIS.2009.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们使用Wu等[13]提出的四种受限旋转进行树变换,并开发了任意两棵二叉树之间权序列变换的算法。在将源树转换为目标树时,不需要旋转每一对权值相同的对应节点。利用该算法,我们还可以得到任意两棵二叉树之间n - 1的上界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信