//based on:https://www.geeksforgeeks.org/binary-heap/ but redone with resizing, template for any objects class, and full garbage management ////////////////////////////////////////// // Minimum Heap Template (heap of objects) ////////////////////////////////////////// // Paul Caron ///////////////////////////////////////// #include #include #include using namespace std; template class minHeap{ private: int size=0; T* arr; int capacity; public: minHeap(int capacity){ arr=new T[capacity]; this->capacity = capacity ; } ~minHeap(){ delete[] arr; } void add(T& data){ if(size>=capacity){ resize(); } int index = size; size++; arr[index] = data; while(index!=0&&arr[index]parent:"<value=value; // cout<<"x"; } Object(const Object& o){ // cout<<"a"; this->value=o.value; } ~Object(){ // cout<<"*" ; }//overloading the < operator for heap sorting bool operator< (const Object& o2){ if(this->value h(10); srand(time(0)); Object o; cout<<"Populating the heap with random values.\n\n"; for(int i=0;i<10;i++){ o=Object(rand()%100); cout<

Min Heap Template (heap of objects)