In a binary max heap containing n numbers, the smallest element can be found in time
O (n)
O (log n)
O (log log n)
O (1)
Correct Option: A
Time taken by binary max heap to identify the max element is O(1). Therefore, the time taken by binary max heap to identify the smallest element is O(n).
