Although tree traversal is a powerful algorithm, this representation seems to offer an alternative implementation. If we know the index of the last non-null value (approx. lastItem = root.length), would something like Math.log(last item) / Math.log(2) be correct? +-1?