...
ISRO CS 2020
October 10, 2023
Nielit Scentist-B [02-12-2018]
October 10, 2023
ISRO CS 2020
October 10, 2023
Nielit Scentist-B [02-12-2018]
October 10, 2023

Algorithms

Question 183
The smallest element that can be found in time___ in a binary max heap
A
O(nlogn)
B
O(logn)
C
O(n)
D
O(n2)
Question 183 Explanation: 
We need to traverse all nodes in order to identify smallest element because it is not following binary search tree properties. Searching time for ‘n’ elements will take O(n) in worst case.
Correct Answer: C
Question 183 Explanation: 
We need to traverse all nodes in order to identify smallest element because it is not following binary search tree properties. Searching time for ‘n’ elements will take O(n) in worst case.

Leave a Reply

Your email address will not be published. Required fields are marked *