Abstract

This paper introduces a bottom-up update mechanism together with a non-recursive initial update procedure that reduces the required extra memory space and computational overhead. A new type of tree is defined based on a different geometrical interpretation of Complete Binary Trees. The new approach paves the way for a special and practical initialization of the tree, which is a prerequisite for an implementation of unilateral update operation. The details of this special initialization and the full update procedures are given for Complete Binary Trees. In addition, a comparison is made between the introduced update method and the bilateral update methods in terms of different performance related metrics.

How to Cite
BULUT, Mevlut. Bottom-up Update Mechanism for Re-structured Complete Binary Trees. Global Journal of Computer Science and Technology, [S.l.], july 2016. ISSN 0975-4172. Available at: <https://computerresearch.org/index.php/computer/article/view/1384>. Date accessed: 17 sep. 2019.