Building a binary heap ADT
A binary heap is a completely binary tree that is usually used to implement a priority queue. Please look at the following binary tree which is representing the priority queue:
To create a binary heap in C++, we will have the heapSize variable, which will be increased when an element is inserted and will be decreased when an element is removed. There are four basic operations in a priority queue, and they are as follows:
IsEmpty()is used to check whether the queue is emptyInsert(), similar to theEnqueue()operation in a Queue data structure, is used to insert a new element into the queueGetMax(), similar to thePeek()operation in a Queue...
