What is the best case complexity in building a heap?
(a) O(nlogn)
(b) O(n^2)
(c) O(n*longn *logn)
(d) O(n)
Origin of the question is Binary Heap in portion Heap of Data Structures & Algorithms I
The question was asked by my school teacher while I was bunking the class.