When to use a Binary Heap based Priority Queue vs a Linked List based Priority Queue?

Question

You can implement a Priority Queue using Binary Heaps or using Linked Lists. I believe the Linked List implementation allows for O(n) insertions and O(1) removals, whereas t