We present a data structure based on AVL-trees which allows an insertion or a deletion to be performed in time O(log d), where d is the distance of the position searched for from a finger which points to the end of the file. Moving a finger to a distance d costs O(log d). This result demonstrates the power of the oldest basic data structure, the AVL-tree. A special case of interest is an efficient implementation of searchable priority queues such that Deletemin requires only constant time. © 1985 Academic Press, Inc.
Tsakalidis, A. K. (1985). AVL-trees for localized search. Information and Control, 67(1–3), 173–194. https://doi.org/10.1016/S0019-9958(85)80034-6