Chapter 17, Problem 12PE

Program Plan Intro

Modifying the implementation of Heap class

Program plan:

MinHeap.java:

• Import the required header files.
• Define a class “MinHeap”.
  • Define a “MinHeap” constructor.
    • This constructor develops an empty heap.
  • Define “add()” method.
    • This function adds a new element to the heap.
  • Define a “peek()” method.
    • This function gets the minimum element in the heap.
    • Returns the minimum element.
  • Define a “remove()” method.
    • This function removes the minimum element in the heap.
    • Returns the minimum element.
  • Define a “fixHeap()” method.
    • This function fixes the given heap by converting the tree into a heap.
  • Define a “size()” function.
    • This function returns the number of elements in this heap.

WorkOrder.java:

• Define a class “WorkOrder” which implements the comparable class.
  • Define a parameterized constructor “WorkOrder()”.
    • This function develops a work order based on priority and description.
  • Define a “toString()” method.
    • This returns the value of priority and description.
  • Define a “compareTo()” method.
    • This Compares the objects with one another.
    • Returns -1 when the priority is less than other priority.
    • Returns 1 when the priority is greater than other priority.
    • Return 0 when both priorities are equal.

HeapTester.java:

• Define the class “HeapTester”.
  • Define the “main()” function
    • Create an object “q” for “MinHeap” class.
    • Add the element to the heap based on “WorkOrder”.
    • Printing the result by calling the “remove()” method for different values.