In order to avoid wasting a spot in a heap-ordered array pq[, let's say that we should place the largest value in position pq[0], its children in positions pq[1] and pq[2], and so on, in level order. Where are pq[k]'s parents and children? 2.4.11 Consider a scenario in which your programme will do a large number of insert operations but only a small number of maximum removal actions. Which priority-queue implementation, ordered array, heap, or both, do you believe would be the most successful?

In order to avoid wasting a spot in a heap-ordered array pq[, let's say that we should place the largest value in position pq[0], its children in positions pq[1] and pq[2], and so on, in level order. Where are pq[k]'s parents and children? 2.4.11 Consider a scenario in which your programme will do a large number of insert operations but only a small number of maximum removal actions. Which priority-queue implementation, ordered array, heap, or both, do you believe would be the most successful?