GO MOCK-2 Doubt

Question

Consider the following possible data structures for a set of n distinct integers.

1. A min-heap
2. An array of length sorted in increasing order
3. A balanced binary search tree

For which of these data structures,  the number of steps needed to find and remove the 9^th largest element in 0(logn)

time in the worst case?

• A. I and III
• B. II and III
• C. I and II
• D. II only

Comments

@anjali007 finding any element takes $O(n)$ in a heap and then deleting would take $O(logn)$. So, it should take $O(n)$

---

@Shobhit Joshi ya sorry I am wrong there... So this implies only 3 is O(logn) isnt it?

---

yes that's what i think