$1$

What is the computational complexity of building a heap in place in the worst case?

$O(n^{{?}^{{?}^{?}}}2)($n squared$)$

O$(1)$

$O(n)$

O$($n $logn$

$O(logn)$