Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees (Q2428686): 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.1007/s00453-011-9489-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2103885358 / rank | |||
Normal rank | |||
Revision as of 22:32, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees |
scientific article |
Statements
Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees (English)
0 references
26 April 2012
0 references
data structures
0 references
binary search trees
0 references
unordered binary trees
0 references
rotations
0 references
off-line lower bound
0 references
Wilber's theorem
0 references
