Q30
What is the key difference between a binary heap and a binary search tree?
A.
A binary heap maintains a heap property and is typically used to implement priority queues, while a binary search tree maintains sorted order of elements.
AnswerB.
A binary heap is a type of balanced tree, while a binary search tree is an unbalanced tree.
C.
A binary heap stores elements in sorted order, while a binary search tree does not.
D.
A binary heap supports fast insertion and deletion, while a binary search tree supports fast search.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board