Question

The smallest item in a binary min-heap must appear in position 1, and the second smallest must be in position 2 or position 3. give the list of positions in a heap of size 31 where the kth smallest can appear, for k=2, 3, 4, 5 (assuming the values to be distinct).

Answer 1

gjcjchg jvv. jchcj. JFK. job