Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees (Q2428686)
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: Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees |
scientific article; zbMATH DE number 6028441
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees |
scientific article; zbMATH DE number 6028441 |
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
0 references
0.89192104
0 references
0.8875975
0 references
0.8768536
0 references
0.8767941
0 references
0.8738589
0 references
0.86785185
0 references
0.8666568
0 references
0.8624613
0 references
0.86220276
0 references
