An efficient algorithm for estimating rotation distance between two binary trees (Q5312707): 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.1080/00207160500069870 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2025994050 / rank | |||
Normal rank | |||
Revision as of 20:25, 19 March 2024
scientific article; zbMATH DE number 2198799
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for estimating rotation distance between two binary trees |
scientific article; zbMATH DE number 2198799 |
Statements
An efficient algorithm for estimating rotation distance between two binary trees (English)
0 references
25 August 2005
0 references
binary trees
0 references
rotation distance
0 references
AVL trees
0 references
algorithms
0 references
