MaxHeap
#include class MaxHeap { public: class Node { public: int data; bool isNull; Node(int data) { this -> data = data; isNull = false; } Node(){ isNull = true; } }; Node *biTree; int top; MaxHeap(){ biTree = new Node[100](); top = 0; } void swap(Node &a, Node &b) { Node temp = a; a = b; b= temp; } void push(int data) { biTree[++top] = Node(data); for(int idx = top; idx != 1 && biTree[idx / 2].data <..
Comment