ReducedCBT and SuperCBT, Two New and Improved Complete Binary Tree Structures

TL;DR

This paper introduces two innovative complete binary tree structures, ReducedCBT and SuperCBT, that enhance memory efficiency and performance by employing a novel local hierarchy between leaves and nodes.

Contribution

The paper presents two new complete binary tree variants with improved memory footprint and performance, introducing a unique local hierarchy independent of the global structure.

Findings

ReducedCBT offers faster operations with smaller memory footprint.

SuperCBT provides size variation functionality with minimal computational overhead.

Both structures significantly improve binary tree-based algorithm efficiency.

Abstract

Between the leaves and the nodes of a complete binary tree, a separate parent-child-sister hierarchy is employed independent of the parent-child-sister hierarchy used for the rest of the tree. Two different versions of such a local hierarchy are introduced. The result of the first proposed hierarchy is a faster and smaller footprint, while the second one provides the size variation functionality without a significant computational overhead. This novel approach brings considerable memory gains and performance boosts to the complete binary tree based algorithms.