All three are correct.
1) heap is an almost complete binary tree.
2) heapify worst case complexity is equal to the height of the tree. i.e O (log n)
3) for bulding a heap we perfrom heapfiy starting from the first non leaf node(n/2 th index) to root 1. Hence worst case is n/2*logn i.e O(nlogn)