I think there might be a mistake in this article, or at least something requiring clarification.

> For convenience, suppose the binary tree is complete and has height H=2^K.

What is K? It's never stated. I'd usually assume H = log N, if N is the number of nodes in a balanced tree.