How ready are you for the Computer Science exam?

An engineer is implementing a priority queue that must support the operations insert and extract-min on a collection of items with distinct priorities. Two implementations are considered: (1) a binary min-heap, and (2) a balanced binary search tree. Both support insert and extract-min in O(log n) time. Which statement correctly analyzes a key difference between these implementations that affects the choice for this workload?

1. AThe binary min-heap uses an array-based representation with no pointers, giving better constant factors and cache performance, while the balanced BST typically uses node-based storage with pointers, making the heap more efficient in practice for priority queue operations.
2. BThe balanced BST supports extract-min in O(1) time by always keeping the minimum at the root, while the heap requires O(log n) time.
3. CThe binary min-heap maintains the items in fully sorted order at all times, allowing extract-min in O(1) time, while the balanced BST does not keep items sorted.
4. DThe balanced BST is more space-efficient because it stores only the items, whereas the heap requires additional storage for pointers.