Chapter 23, Problem 23.11PE

Program Plan Intro

Heap clone and equals

Program Plan:

• Import the required packages.
• Declare and initialize the required variables.
• Create a class “Sorting”:
  • Define the main method
    • A new heap gets defined.
    • Add the elements into the heap.
    • Compare the heap values that are generated.
• Define the class “Heap”
  • New array list gets created.
  • New empty heap gets created.
  • Define the class “Heap”
    • New list gets defined.
    • New heap empty gets created.
    • Define the method “Heap()”
      • Loop that iterates to add the elements into the heap.
    • Define the method “add()”
      • Add the object.
      • Loop that iterates for the values present and add them after validation.
    • Define the method “remove()”
      • Condition to validate the elements of the list
      • Loop that iterates to remove the elements present in the list.
    • Define the method “getSize()”
      • Size of the list gets returned.
    • Define the object clone
      • New heap gets created.
      • Clone of the array list gets created.
      • Return the clone of the heap.
    • Define the method “equals”
      • Condition to validate the heap.
      • Return true or false after validation.