Question $3$

$1$ pts

What is the height, $h,$ of a binary tree representing a heap with $n$ nodes?

$n^2$

${|}_{{?}_{?}}logn|$

$nlogn$

$$ best case $logn,$ worst case $n$