Question

Could anyone help me solve this C++ problem? Thanks a lot

create a class called minHeap to demonstrate the min Heap data structure of type integer. use a vector to implement the concept. in this class, have the following:

private:

• vector of the type integer
• integer to store the index of the last element in the min heap "vector"
• integer to store the size (number of items in the vector "min heap")

public:

• default constructor to set the size to zero and the index of the last element to -1
• an add method to add an element to the min-heap
• a delete method to delete the root of the min-heap
• a size method to return the number of elements of the min-heap
• an empty method to check if the min-heap is empty.
• use your work to sort the min-heap elements. use a new vector to store the sorted elements.

Answer 1

#include <vector>

#include<bits/stdc++.h>

using namespace std;

class PriorityQueue {

    vector<int> pq;

int ind;

    public :

    PriorityQueue() {

pq.clear();

ind = -1;

}

    bool isEmpty() {

        return pq.size() == 0;

    }

    // Return the size of priorityQueue - no of elements present

    int getSize() {

        return pq.size();

    }

    int getMin() {

        if(isEmpty()) {

            return 0;       // Priority Queue is empty

        }

        return pq[0];

    }

    void insert(int element) {

        pq.push_back(element);

        

        int childIndex = pq.size() - 1;

ind = pq.size()-1;

        while(childIndex > 0) {

            int parentIndex = (childIndex - 1) / 2;

            if(pq[childIndex] < pq[parentIndex]) {

                int temp = pq[childIndex];

                pq[childIndex] = pq[parentIndex];

                pq[parentIndex] = temp;

            }

            else {

                break;

            }

            childIndex = parentIndex;

        }

    }

int removeMin() {

// Complete this function

if(isEmpty())

return 0;

int ans=pq[0];

pq[0]=pq[pq.size()-1];

pq.pop_back();

ind = pq.size()-1;

int pi=0;

int lci= 2*pi+1;

int rci= 2*pi+2;

while(lci<pq.size()){

int mi=pi;

if(pq[mi]>pq[lci])

mi=lci;

if(pq[mi]>pq[rci] && rci<pq.size())

mi=rci;

if(mi==pi)

break;

int temp=pq[mi];

pq[mi]=pq[pi];

pq[pi]=temp;

pi=mi;

lci=2*pi+1;

rci=2*pi+2;

}

return ans;

}

};

int main() {

PriorityQueue pq;

int choice;

cin >> choice;

while(choice != -1) {

switch(choice) {

case 1 : // insert

int element;

cin >> element;

pq.insert(element);

break;

case 2 : // getMax

cout << pq.getMin() << endl;

break;

case 3 : // removeMax

cout << pq.removeMin() << endl;

break;

case 4 : // size

cout << pq.getSize() << endl;

break;

case 5 : // isEmpty

if(pq.isEmpty()) {

cout << "true" << endl;

}

else {

cout << "false" << endl;

}

default :

return 0;

}

cin >> choice;

}

}

(If you like the answer, please press 'like' button, Thank you)