Abstract
An amortized analysis of the insertion and deletion algorithms ofk-dimensional balanced binary trees (kBB-trees) is performed. It is shown that the total rebalancing time for a mixed sequence ofminsertions and deletions in akBB-tree of sizenisO(k(m+n)). Based on 2BB-trees, a self-organizing tree, called aself-organizing balanced binary tree, is defined. It is shown that the average access time for an item stored in the tree is optimal to within a constant factor, while the worst-case access time is logarithmic. The amortized analysis ofkBB-trees leads to the result that the total update time for a mixed sequence ofmaccesses, insertions, and (restricted) deletions in a self-organizing balanced binary tree initially storingndata items isO(m+n)
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.
