Vidyalelo
Data Structure · Q106

Heaps

Programming · Data Structure · question 106

Q106

An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of

A.
O(n*n*logn)
B.
O(n*logn)
Answer
C.
O(n*n)
D.
O(n *logn *logn)

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board