On the upper bound on the rotation distance of binary trees (Q1823251): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(89)90069-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974505029 / rank | |||
Normal rank | |||
Revision as of 20:05, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the upper bound on the rotation distance of binary trees |
scientific article |
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
