On the upper bound on the rotation distance of binary trees (Q1823251)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the upper bound on the rotation distance of binary trees |
scientific article; zbMATH DE number 4114656
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the upper bound on the rotation distance of binary trees |
scientific article; zbMATH DE number 4114656 |
Statements
On the upper bound on the rotation distance of binary trees (English)
0 references
1989
0 references
The rotation distance between two binary search trees \(T_ 1\) and \(T_ 2\) on n nodes is the minimum number of rotations needed to transform \(T_ 1\) into \(T_ 2\). It is known that an upper bound to the rotation distance is 2n-6. The authors present a proof of the bound by a tree transformation algorithm.
0 references
binary trees
0 references
rotation distance
0 references
binary search trees
0 references
