2- Implement a class template MinHeap that has the following declaration using c++ class MinHeap { Node* heap; //an array of nodes int _size; //size of array public: Node extractMin(); //returns & removes the node with minimum cost void buildMinHeap(Node[],int);// allocates array then builds a min-heap from an array of struct Node with the given size void minHeapify(int i, int n);//restores the min-heap property for the “heap” array using the given index and size n void decreaseKey(char label,int newCost);//decreases the node that has the given label to newCost int parent(int i);//returns the index of the parent of i int getSize();//returns size of the heap bool inHeap(char);//checks if the node with the given label is in the heap };
2- Implement a class template MinHeap that has the following declaration using c++ class MinHeap { Node* heap; //an array of nodes int _size; //size of array public: Node extractMin(); //returns & removes the node with minimum cost void buildMinHeap(Node[],int);// allocates array then builds a min-heap from an array of struct Node with the given size void minHeapify(int i, int n);//restores the min-heap property for the “heap” array using the given index and size n void decreaseKey(char label,int newCost);//decreases the node that has the given label to newCost int parent(int i);//returns the index of the parent of i int getSize();//returns size of the heap bool inHeap(char);//checks if the node with the given label is in the heap };
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
2- Implement a class template MinHeap that has the following declaration using c++
class MinHeap
{
Node* heap; //an array of nodes
int _size; //size of array
public:
Node extractMin(); //returns & removes the node with minimum cost
void buildMinHeap(Node[],int);// allocates array then builds a min-heap from an
array of struct Node with the given size
void minHeapify(int i, int n);//restores the min-heap property for the “heap”
array using the given index and size n
void decreaseKey(char label,int newCost);//decreases the node that has the given
label to newCost
int parent(int i);//returns the index of the parent of i
int getSize();//returns size of the heap
bool inHeap(char);//checks if the node with the given label is in the heap
};
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education