All of the elements in a Heap are sorted, where the largest or smallest element is always placed at the top $($parent node$)$ depending on what kind of Heap we are using.