Loading...
Loading...

Go to the content (press return)

Digital access to comparison-based tree data structures and algorithms

Author
Roura, S.
Type of activity
Report
Date
1999-07
Code
LSI-99-26-R
Repository
http://hdl.handle.net/2117/96883 Open in new window
Abstract
This paper presents a simple method to build tree data structures which achieve just O(log N) visited nodes and O(D) compared digits (bits or bytes) per search or update, where N is the number of keys and D is the length of the keys, irrespectively of the order of the updates and of the digital representation of the keys. The additional space required by the method is asymptotically dismissable compared to the space of keys and pointers, and is easily updated on line. The method applies to fixed...
Citation
Roura, S. "Digital access to comparison-based tree data structures and algorithms". 1999.
Keywords
Tree data algorithms, Tree data structures building
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants

Attachments