BinaryHeap constructor performs differently from heapify

I noticed that BinaryHeap like BinaryMinHeap constructs a heap that just insert every element from an array to a empty heap. And the following x and y have the same order:

julia> nums = rand(1:20000, 2000);

julia> x = MutableBinaryMinHeap(nums);

julia> y = BinaryMinHeap(Int.([]));

julia> for i in nums 
           push!(y, i)
       end

However, there is an O(N) heap-building algorithm instead of O(NlogN), and function heapify is an implement. So why not use heapify instead of insert successively？

Sincerely.

Inspect the BinaryHeap and BinaryMinHeap constructors and the existing heapify function mentioned in the issue. Compare the constructor with the provided successive-push examples. Done means construction uses the linear-time heap-building approach while preserving the observed heap behavior.