Abstract
A new data structure called a weighted leaf AVL-tree is presented for representing a collection of weighted items drawn from a totally ordered set. It is shown that using this data structure, the average access time of an item is optimal to within a constant factor while the worst-case access time is “logarithmic.” The data structure is a generalization of a leaf AVL-tree to the weighted-item case and retains its restructuring simplicity. It is shown that the data structure supports a number of update operations in a simple and worst-case efficient manner.
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.
