The binary heap discussed in class is a special

Program  2                   
Implementation of D-Heaps
The binary heap discussed in class is a special case of a d-heap with d=2. Write the methods for
deleteMin (and percolate down)
insert
buildHeap
 
for a d-heap. Use an array to implement the d-Heap in a similar manner to the definition of the BinaryHeap data structure given in Figure 6.4 of the Weiss book. d should now be an private integer data member of the DHeap class. You should read the heap elements and d from the console and print the output in the following manner:
 
for a d-heap. Use an array to implement the d-Heap in a similar manner to the definition of the BinaryHeap data structure given in Figure 6.4 of the Weiss book. d should now be an private integer data member of the DHeap class. You should read the heap elements and d from the console and print the output in the following manner:
 
Enter heap elements: 12 13 11 4 7 9 3 15 8 5 6 14 2
………..
 
Every method or function should have a comment header describing inputs, outputs, and what it does. An example function comment is shown below:
/***************************************************
*  FUNCTION  xxyyzz : (function name)                     *
*    the purpose of this function                         *
*  INPUT PARAMETERS :                               *                *    a list of all parameters and their meaning    *   
*  OUTPUT :                                                      *                *    the description about returning value         *   
   ****************************************************/
Inline comments should be utilized as necessary (but not overused) to make algorithms clear to the reader.