Priority Queues

Reading

Create a class TernaryHeap under queue extending the abstract class AbstractPriorityQueue.
Each node in TernaryHeap must take at most 3 children instead of 2 (so it becomes a ternary instead of binary tree). Feel free to use the code in BinaryHeap.
Run the unit test and make sure your heap performs accurately.
Compare the speed between TernaryHeap and BinaryHeap for both the add and remove operations using the unit test. Write a report about the speed comparison and save it as quiz1.pdf.
Submit TernaryHeap.java and quiz1.pdf: https://canvas.emory.edu/courses/32845/assignments/73020

Emory University