Suppose that binary heaps are represented using explicit links. Give a simple algorithm to find the tree node that is at implicit position i.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.