Question: What is the primary difference between a binary heap and a binary search tree?

Options:

1. Binary heaps are complete binary trees, while binary search trees are not
2. Binary heaps allow duplicate elements, while binary search trees do not
3. Binary heaps are used for priority queues, while binary search trees are used for searching
4. All of the above

Correct Answer: All of the above

Solution:

The primary differences include that binary heaps are complete binary trees used for priority queues, while binary search trees are not necessarily complete and are used for searching.