Max Heap Lab

Heap data structure called to be a complete binary tree while maintaining the heap property, where given node is

always greater than its child node$/$s and the key of the root node is the largest among all other nodes. This property is also called max heap property.

always smaller than the child node$/$s and the key of the root node is the smallest among all other nodes. This property is also called min heap property.

You are given a code with Pseudo code. Knowing the properties from the Chapter, write the logic for following methos$-$ heapify, insert, deleteNode