Lower Bounds for Accessing Binary Search Trees with Rotations (Q3829056)
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: Lower Bounds for Accessing Binary Search Trees with Rotations |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lower Bounds for Accessing Binary Search Trees with Rotations |
scientific article |
Statements
Lower Bounds for Accessing Binary Search Trees with Rotations (English)
0 references
1989
0 references
data structures
0 references
binary search tree
0 references
rotation
0 references
lower bound
0 references