Question #23191

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

I. A min-heap

II. An array of length n sorted in increasing order

III. A balanced binary search tree

For which of these data structures is the number of steps needed to find and remove the 7th largest element

O n (log ) in the worst case?

(A) I only (B) II only (C) I and II (D) I and III (E) II and III

I. A min-heap

II. An array of length n sorted in increasing order

III. A balanced binary search tree

For which of these data structures is the number of steps needed to find and remove the 7th largest element

O n (log ) in the worst case?

(A) I only (B) II only (C) I and II (D) I and III (E) II and III

Expert's answer

## Comments

## Leave a comment