3 ms·
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
by TristanDaCunha 6y ago
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.
- DavidSJ 6y agoI think K is just an arbitrary natural number. The author is assuming the height is a power of 2, and giving the name K to the log_2 of that height.