Abstract
We define a new class of mergeable heaps that we call H-heaps. Using H-heaps we can process an on-line sequence of mergeable priority queue operations when the elements are integers in the range 1,…, N in amortized time O(log log N) and worst-case time O(log N) per operation.
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.
