{"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}
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
