The Distance between Binary Trees under 4-Border Rotations
碩士 === 國立暨南國際大學 === 資訊工程學系 === 97 === The k-restricted rotation distance d2-R(S, T) between two binary trees S and T of n vertices is the minimum number of rotations to transform S into T , where rotations take place at all the vertices in the highest k levels of the tree. A sharp upper bound d2-R(S...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/70732656420127958087 |