Question

Total number of possiblr positions in a min heap of n elements where the third largest element can be stored is

Answer 1

Time to find the smallest element on a min-heap- one retrieve operation - Θ(1)Θ(1)

Time to find the second smallest element on a min-heap- requires 22−1=322−1=3 check operations to find the second smallest element out of 33 elements - Θ(1)