heaps

Question 1

what are 4 heap operations

Answer 1

-find min/max
-delete min/max
-insert element
-bouiding heap

Question 2

time complexity of find min

Answer 2

O(1)

Question 3

insert elemnt time complexity

Answer 3

O(log n)

Question 4

dequeue time complexity

Answer 4

O(n log n)

Question 5

building heaps code

Answer 5

Given an array of numbers fix each element
For (x = (n/2)-1; x >= 0; –x){
Trickle down to restore heap property
}