Abstract
We give a representation for linked lists which allows to efficiently insert and delete objects in the list and to quickly determine the order of two list elements. The basic data structure, called an indexed BB[α]-tree, allows to do n insertions and deletions in O(n log n) steps and determine the order in constant time, assuming that the locations of the elements worked at are given. The improved algorithm does n insertions, deletions and comparisons in O(n log* n) steps.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. Blum and K. Mehlhorn "On the average number of rebalancing operations in weight-balanced trees", Theoretical Computer Science 11 (1980), p. 303–320.
P. Dietz "Maintaining order in a linked list", 14th ACM SIGACT Symposium on Theory of Computing (1982), p. 122–127.
S. Huddleston and K. Mehlhorn "A new data structure for representing sorted lists", Acta Informatica 17 (1982), p. 157–184.
Th. Lengauer and K. Mehlhorn "HILL-Hierarchical Layout Language, A CAD-System for VLSI-Design", Technischer Bericht A 82/10, Universität des Saarlandes (1982).
K. Mehlhorn "Effiziente Algorithmen", Teubner Verlag (1977).
J. Nievergelt and E.M. Reingold "Binary search trees of bounded balance", SIAM Journal of Computing, Vol. 2 (1973), p. 33–43.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsakalidis, A.K. (1982). Maintaining order in a generalized linked list. In: Cremers, A.B., Kriegel, HP. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036494
Download citation
DOI: https://doi.org/10.1007/BFb0036494
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11973-9
Online ISBN: 978-3-540-39421-1
eBook Packages: Springer Book Archive