The objective of this experiment is to Convert the given Complete Binary Tree into a Max Heap.
In the previous experiment, we converted a Complete Binary Tree to a Max heap by swapping any two nodes that have parent-child relationship between them. In this experiment, a restriction has been added on top of previous restriction that the swap operation can only be performed between two nodes if the value of parent node is smaller than the value of child node.
You can click on any node to select/deselect it. You can select at most two nodes at a time. The selections are reset after each swap operation.