Question 19 Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion […]
Question 22 Consider the following statements about heap sort algorithm A.The MAX-HEAPIFY procedure which runs in O lg(n) time, is the key to maintaining the max […]