Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees (Q2428686): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-011-9489-2 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-011-9489-2 / rank | |||
Normal rank | |||
Latest revision as of 14:07, 18 December 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
0 references
