Vidyalelo
Data Structure · Q29

Heaps

Programming · Data Structure · question 29

Q29

In a max-heap, what is the time complexity to find the second largest element?

A.
O(1)
B.
O(log n)
Answer
C.
O(n)
D.
O(n log n)

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board