An operator delete(i) for a binary heap data structure is to be designed to delete the item in the i-th node. Assume that the heap is implemented in an array and i refers to the i-th index of the array. If the heap tree has depth d (number of edges on the path from the root to the farthest leaf), then what is the time complexity to re-fix the heap efficiently after the removal of the element?

An operator delete(i) for a binary heap data structure is to be design

1.	An operator delete(i) for a binary heap data structure is to be designed to delete the item in the i-th node. Assume that the heap is implemented in an array and i refers to the i-th index of the array. If the heap tree has depth d (number of edges on the path from the root to the farthest leaf), then what is the time complexity to re-fix the heap efficiently after the removal of the element?
A.	O(1)
B.	O(d) but not O(1)
C.	O(2d) but not O(d)
D.	O(d2d) but not O(2d)
Answer» C. O(2d) but not O(d)

Discussion

No Comment Found

Related MCQs

Let H be a primary min-heap consisting of n elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum element in H?
Given two sorted list of size ‘m’ and ‘n’ respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be:
A priority queue is implemented as a Max-heap. Initially it has 5 elements. The level order traversal of the heap is 10, 8, 5, 3, 2. Two new elements ‘1’ and ‘7’ are inserted into the heap in that order. The level order traversal of the heap after the insertion of the elements is
Given a binary-max heap. The elements are stored in an arrays as 25, 14, 16, 13, 10, 8, 12.What is the content of the array after two delete operations?
In a binary max heap containing n numbers, the smallest element can be found in ______ time.
______ Sorting compares two adjoining values and exchange them if they are not in proper order.
Algorithm design technique used in quicksort algorithm is?
In hashing, collision resolution is carried out by close addressing. Which of the following is close addressing technique –I. Buckets (for contiguous storage)II. Chains (for linked storage)
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order 20, 47, 15, 8, 9, 4, 40, 30, 12, 17 then the order of these elements after the second pass of the algorithm is:
Consider the C function given below. Assume that the array listA contains n (> 0) elements, sorted in ascending orderint ProcessArray(int *listA, int x, int n){int i, j, k;i = 0;j = n-1;do { k = (i+j)/2; if (x <= listA[k]) j = k-1; if (listA[k] <= x) i = k+1; } while (i <= j);if (listA[k] == x) return(k);else return -1;}Which one of the following statements about the function ProcessArray is CORRECT?

Discussion

No Comment Found

Related MCQs

Reply to Comment