Heap Property vs. BST Property

A heap orders each node only against its children (vertical, partial); a BST orders each node against whole subtrees (horizontal, total) so an in-order walk is sorted — that gap forces an $\Omega(n\log n)$ comparison cost to turn a heap into a BST.