Q17
What is the main difference between a binary heap and a binary search tree?
A.
A binary heap does not maintain a sorted order while a binary search tree does.
AnswerB.
A binary heap maintains a sorted order while a binary search tree does not.
C.
Binary heaps are always balanced while binary search trees are not.
D.
Binary heaps have only one child per node, binary search trees have two.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board