Q148
What is the best case complexity in building a heap?
A.
O(nlogn)
B.
O(n2)
C.
O(n*longn *logn)
D.
O(n)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board