Space-efficient finger search on degree-balanced search trees

@inproceedings{Blelloch2003SpaceefficientFS,
  title={Space-efficient finger search on degree-balanced search trees},
  author={Guy E. Blelloch and Bruce M. Maggs and Maverick Woo},
  booktitle={SODA},
  year={2003}
}
We show how to support the finger search operation on degree-balanced search trees in a space-efficient manner that retains a worst-case time bound of O(log d), where d is the difference in rank between successive search targets. While most existing tree-based designs allocate linear extra storage in the nodes (e.g., for side links and parent pointers), our design maintains a compact auxiliary data structure called the "hand" during the lifetime of the tree and imposes no other storage… CONTINUE READING