Heap sort best case time - $\mathcal O(n)$?
Big O is for measuring the worst case time complexity, and in this case it is $O(n)$. The best case is written as $\Omega$.  Here is a paper describing the reasoning for the best case. We generally do not consider the case of having only identical elements in the list.