R4R.CO.IN
About
Services
Contact
In min Heap, the cost of finding smallest elements is:-
Home
Question:In min Heap, the cost of finding smallest elements is:-
1.O(n)
2.O(1)
3.O(logn)
4.None of the above
Show Answer
Answer:2
← Older
Newer →
Search
Go!
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!