Table Dimensions

The table has $n$ rows (one per node) and $\lceil \log_2 n \rceil$ columns (one per power of $2$ up to $n$). Why $\log n$ columns?

Because the maximum jump is $n-1$ (from a leaf to the root), and $2^{\lceil \log_2 n \rceil} \geq n$. You do not need columns for larger powers. Total space: $O(n \log n)$. For $n = 100,000$, that is about $100,000 \times 17 = 1.7$ million entries.

Totally manageable.