2. Priority Queues

This chapter discusses different types of priority queues and benchmarks their performance in terms of the worst-case complexities.

Contents

1. Simple Priority Queues

2. Binary Heap

3. Unit Testing

4. Benchmarking

5. Quiz

Resources

• Main: src/main/java/edu/emory/cs/queue

• Test: test/java/edu/emory/cs/queue

References

• Binary Heap

• Fibonacci Heap