| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428482 | Information Processing Letters | 2016 | 4 Pages |
Abstract
•Resolved open problem on performance of AVL trees in terms of rotations.•n mixed insertions and deletions can cause Θ(nlogn)Θ(nlogn) rotations.•We show a class of AVL trees that allow such expensive operations.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Mahdi Amani, Kevin A. Lai, Robert E. Tarjan,