Implement Heap (constructors, trickleUp and trickleDown), MyPriorityQueue (constructor, offer, poll, peek and isEmpty) and HeapSort (using heap directly or using PriorityQueue.poll). Comparators should be used.(Do not forget about the methods in the Heap, MyPriorityQueue and HeapSort as they are all required.)

I need help. I tried to run these two classes (Copy the links down below and paste them on the address bar

Heap: https://pastebin.com/RShcqnCe

MypriorityQueue: https://pastebin.com/4q5q2cnS

but I got errors. 8 errors for Heap and 10 errors for MyPriorityQueue

Link to the errors: https://pastebin.com/KsSZ2znQ

Can someone help me with this and can someone help with the HeapSort for this Java program?

Question

Implement Heap (constructors, trickleUp and trickleDown), MyPriorityQueue (constructor, offer, poll, peek and isEmpty) and HeapSort (using heap directly or using PriorityQueue.poll). Comparators should be used.(Do not forget about the methods in the Heap, MyPriorityQueue and HeapSort as they are all required.)

I need help. I tried to run these two classes (Copy the links down below and paste them on the address bar

Heap: https://pastebin.com/RShcqnCe

MypriorityQueue: https://pastebin.com/4q5q2cnS

but I got errors. 8 errors for Heap and 10 errors for MyPriorityQueue

Link to the errors: https://pastebin.com/KsSZ2znQ

Can someone help me with this and can someone help with the HeapSort for this Java program?

Accepted Answer

The Answer is in the image, click to view ...

Question

Implement Heap (constructors, trickleUp and trickleDown), MyPriorityQueue (constructor, offer, poll, peek and isEmpty) and HeapSort (using heap directly or using PriorityQueue.poll). Comparators should be used.(Do

Step by Step Solution

Step: 1

Get Instant Access to Expert-Tailored Solutions

Step: 2

Step: 3

Ace Your Homework with AI