Are you sure you're getting this? Fill in the missing part by typing it in.

Heap Sort is a comparison-based sorting algorithm that uses a binary heap data structure to sort elements. It has a time complexity of O(n log n). The Heap Sort algorithm consists of the following steps:

1. Build a ____ from the input data.
2. Swap the root node with the last node and remove the last node from the heap.
3. Repeat steps 2 and 3 until the heap is empty.
4. Restore the heap property by comparing the swapped element with its children and swapping if necessary.