Abstract
Levcopolous and Overmars ( Acta Inform., 26 (1988) 269-277) describe a search tree with O(1) worst-case update time, i.e., the time to insert or delete a key is O(1) in the worst case if the position of the key is known. Their data structure does not support fingers, pointers to specific keys such that access and update operations in the vicinity of a finger are especially efficient. We modify their data structure to support fingers while still maintaining O(1) worst-case update time, partially improving upon an earlier result of Harel (University of California, Davis, TR #154, 1980) who achieved O(log * n) worst-case update time in a search tree with fingers. Our data structure uses the random-access machine (RAM) model with unit-cost measure and logarithmic word size; the data structures of Levcopolous and Overmars and Harel use the weaker pointer machine model.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
