Question
Which practice avoids a common mistake with PriorityQueue and Heap Basics?
- Ignore the PriorityQueue and Heap Basics issue and rely on team discipline instead of APIs or contracts.
- Silence the PriorityQueue and Heap Basics problem by using raw types, broad catches, or shared mutable state.
- Prefer the version of PriorityQueue and Heap Basics that makes behavior less predictable as long as the code compiles.
- Do not assume iterating a PriorityQueue returns globally sorted order, because only the head has ordering guarantees.
Hint
Look for the option that protects correctness instead of hiding the problem.
Answer and rationale
Correct answer: D. Do not assume iterating a PriorityQueue returns globally sorted order, because only the head has ordering guarantees.
Do not assume iterating a PriorityQueue returns globally sorted order, because only the head has ordering guarantees. This is a common failure mode in real Java code and a frequent interview follow-up.
Track: Java