Q73
In a binary min heap containing n elements, the largest element can be found in . . . . . . . . time.
A.
O(n)
AnswerB.
O(nlogn)
C.
O(logn)
D.
O(1)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board