Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees (Q2428686): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Static optimality and dynamic search-optimality in lists and trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The pairing heap: A new form of self-adjusting heap / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2721966 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Key-independent optimality / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The cost of offline binary search tree algorithms and the complexity of the request sequence / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Self-adjusting binary search trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rotation Distance, Triangulations, and Hyperbolic Geometry / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower Bounds for Accessing Binary Search Trees with Rotations / rank | |||
Normal rank | |||
Revision as of 02:37, 5 July 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
