recategorized by
1,257 views

3 Answers

3 votes
3 votes
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.
2 votes
2 votes

THE SMALLEST ELEMENT IS AT THE LEAF LEVEL IN BINARY MAX HEAP,WHICH HAS ROUGHLY N/2 ELEMENTS. SO WE NEED TO TRAVERSE ALL THESE ELEMENTS.

THEREFORE CORRECT ANSWER IS OPTION C.

edited by
1 votes
1 votes
We can convert the Max heap into the Min heap, using build heap method which would take O(n) time and then take root element in O(1), which is the minimum.
Answer:

Related questions

2 votes
2 votes
3 answers
1
Arjun asked Dec 7, 2018
1,371 views
For the given nodes:$89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100$minimum ______ number of interchanges are required to convert it into a max-heap.$3$$4$$5$$6$
5 votes
5 votes
5 answers
2
Arjun asked Dec 7, 2018
2,066 views
______ to evaluate an expression without any embedded function calls.Two stacks are requiredone stack is neededThree stacks are requiredMore than three stacks are require...
1 votes
1 votes
2 answers
3
Arjun asked Dec 7, 2018
3,416 views
For a given hash table $T$ with $10$ slots that stores $1000$ elements, the load factor $\alpha$ for $T$ is$100$$0.01$$200$$1.05$
1 votes
1 votes
1 answer
4
Arjun asked Dec 7, 2018
4,248 views
____ is the worst-case time complexity for all operations (i.e.,) search, update and delete) in a general Binary Search tree$O(n)$$O(n \log n)$$O( \log n)$ for search and...