1,520 views
0 votes
0 votes
Consider a binary tree, where left and right subtreealready heapified. But we havenot done heapificationfor root yet. Then what is time complexity to convert it in a full heap tree?

$A)O(\log n)$ or $o(n)$   $B)\Omega (\log n)$ or $\omega(n)$  $C)\Theta (\log n)$ or $\theta (n)$  $D)\text{None of these}$

Please log in or register to answer this question.

Related questions

9 votes
9 votes
2 answers
1
vineet.ildm asked Nov 7, 2016
5,807 views
Why space complexity of heapsort is O(1)....and why not O(logn)..because of space required by recursion calls which is equivalent to height of the tree...where am i getti...
1 votes
1 votes
1 answer
2
reena_kandari asked Jul 30, 2016
987 views
The number of elements that can be sorted in time using heap sort ?
0 votes
0 votes
0 answers
4