Question
State the complexity of algorithm given belowint function(vector arr) int len=arr.length(); if(len==0) return; temp=arr[len-1]; arr.pop_back(); return temp;
Answer: Option C
Was this answer helpful ?
Deletion in a min-heap is in O(1) time.
Was this answer helpful ?
More Questions on This Topic :
Question 1. Heap can be used as¦ ....
Submit Solution