A min heap may be heavily skewed to the left
时间: 2024-05-24 10:13:51 浏览: 127
, what is the time complexity of deleting the maximum element from it?
The time complexity of deleting the maximum element from a heavily skewed left min heap is O(log n), where n is the number of elements in the heap.
阅读全文