What is the primary difference between a binary heap and a binary search tree?
-
Binary heaps are complete binary trees, while binary search trees are not
-
Binary heaps allow duplicate elements, while binary search trees do not
-
Binary heaps are used for priority queues, while binary search trees are used for searching
-
All of the above
