@article{oai:u-nagano.repo.nii.ac.jp:00000532,
 author = {清水, 道夫 and Shimizu, Michio},
 journal = {長野県短期大学紀要, Journal of Nagano Prefectural College},
 month = {Dec},
 note = {40002771510, application/pdf, A certain distance between two binary trees is defined. The distance is the minimal number of the rotations changing from tree A to tree B．If the distance between tree A and tree B is 1, we say that the two trees are connected. Binary trees are expressed by the codewords as the computer representations, and ranked by the lexicographic generation of codewords. An algorithm that makes the table of the connection using the rank is proposed. The distance is expressed by the minimal path length on the graph made from the table.},
 pages = {83--89},
 title = {ローテーションの回数に基づく2分木間の距離},
 volume = {47},
 year = {1992},
 yomi = {シミズ, ミチオ}
}