On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations

The model of node access operations taking place in binary search trees subject to rotations is extended to unordered binary trees, as motivated by consideration of certain self-adjusting priority queues. Rotations in this extended model can be preceded by sibling subtree swaps. Whereas the Wilber l...

Full description

Saved in:
Bibliographic Details
Published inAlgorithms and Data Structures Vol. 6844; pp. 423 - 437
Main Author Fredman, Michael L.
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2011
Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Access Request
Binary Search Tree
Dynamic Optimality
Extended Model
Search Tree
Online AccessGet full text
ISBN9783642222993
3642222994
ISSN0302-9743
1611-3349
DOI10.1007/978-3-642-22300-6_36

Cover

More Information
Summary:The model of node access operations taking place in binary search trees subject to rotations is extended to unordered binary trees, as motivated by consideration of certain self-adjusting priority queues. Rotations in this extended model can be preceded by sibling subtree swaps. Whereas the Wilber lower bound for off-line computation extends to this model of computation – a precondition for the possibility of dynamic optimality – the goal of dynamic optimality is nonetheless demonstrated to be unattainable in this model.
ISBN:9783642222993
3642222994
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-22300-6_36