A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees

We present a new iterative balancing algorithm for binary trees of size N = 2
ⁿ
-1 by exploiting the similarity of pointer restructuring at each level. We also extract parallelism from this algorithm to yield a constant time complexity balancing algorithm for an N-processor configuration. This achieves the theoretical limit of speedup possible.