In a binary max heap containing numbers, the smallest element can be found in ____ time.

1. AO(n)
2. BO(log₂ n)
3. CO(1)
4. DO(log₂ log₂ n)

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: A. O(n)

Explanation

In a max-heap the minimum is one of the ~n/2 leaves, with no order among them, so finding it takes O(n).