If instead, all nodes are smaller than their children, it is called a min-heap Starting from a complete binary tree, we can modify it to become a Max-Heap by running a function called heapify on all ...