Java Algorithms

Consider a one$-$indexed array of length $6$ containing $[54,23,45,11,3,41].$ Imagine BUILD$-$MIN$-$HEAP is invoked on the entire array. Draw it as a binary tree max heap $($with some potentially violated heap properties$)$ before BUILD$-$MIN$-$HEAP, and then draw the tree as it would appear immediately after each iteration of the BUILD$-$MIN$-$HEAP outer loop. Draw them all in chronological order, and label every node with its value.

Hints: The shape of the tree is the same every time, but the node values change. In a max heap$$s MAX$-$HEAPIFY, we often want to find the largest child, but not in MIN$-$HEAPIFY!