Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Programming and Data Structure Programming in C
The worst case time complexity in deleting a particular element in min-heap with n elements is
1
O(1)
2
O(loglogn)
3
O(logn)
4
O(n)
The worst case time complexity in deleting a particular element in min-heap with n elements is