in DS
1,517 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}$
in DS
by
1.5k views

4 Comments

how here  f1(n) slower than f2(n)?

plz chk

https://gateoverflow.in/177712/running-time

0
0
srestha is it A na ? what is conclusion
0
0

Please log in or register to answer this question.

Related questions