Chapter 9
Priority Queues, Heaps, and Graphs
Knowledge Goals
You should be able to
describe a priority queue at the logical level and discuss alternative implementation approaches
define a heap and the operations reheap up and reheap down
describe the shape and order properties of a heap
compare the implementations of a priority queue using a ...
Get Object-Oriented Data Structures Using Java, 3rd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
