Data Structures and Algorithm Analysis by Cliffor A. Shaffer Let's build a max heap Number Groups void buildHeap () // Heapify contents of Heap Our heap size is 9 and we have the following values to build into a heap: for (int i-n/2-1; i>-0; i--) siftdown (i); ) // Helper function to put element in its correct place void siftdown (int pos) while (!isLeaf (pos)) // Stop if posis a leaf int j- leftchild (pos); int rc- rightchild (pos); if ((rc n/2) && (pos