2.5. Quiz
Quiz 2: Priority Queues
Last updated
Was this helpful?
Quiz 2: Priority Queues
Last updated
Was this helpful?
Create a class called under the main package that extends the abstract class .
Each node in TernaryHeapQuiz
takes up to 3 children, so it becomes a ternary instead of a binary tree.
Override the required abstract methods, , , and , such that both add()
and remove()
give .
Feel free to use the code in .
Create the class under the test package.
Test the correctness of your TernaryHeapQuiz
using the method.
Add more tests for a more thorough assessment if necessary.
Compare runtime speeds between BinaryHeap
and TernaryHeapQuiz
for add()
and remove()
using the method.
Create a PDF file quiz2.pdf and write a report that includes the following:
A table and a chart to compare speeds between the two priority queues for those two methods, add()
and remove()
, with respect to different input sizes.
A brief explanation of why a certain PQ is faster than the other PQ with respect to different input sizes.
1. Commit and push everything under the following packages to your GitHub repository:
2. Submit quiz2.pdf to Canvas.
Main:
Test: