Maintaining order in a linked list

  • Authors:
  • Paul F. Dietz

  • Affiliations:
  • -

  • Venue:
  • STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
  • Year:
  • 1982

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new representation for linked lists. This representation allows one to efficiently insert objects into the list and to quickly determine the order of list elements. The basic data structure, called an indexed 2-3 tree, allows one to do n inserts in O(nlogn) steps and to determine order in constant time. We speed up the algorithm by dividing the data structure up into log*n layers. The improved algorithm does n insertions and comparisons in O(nlog*n) steps. The paper concludes with two applications: determining ancestor relationships in a growing tree and maintaining a tree structured environment (context tree).