Q19
What is the key difference between a Binary Search Tree (BST) and a Binary Heap?
A.
A BST maintains sorted order of elements, while a Binary Heap maintains a heap property.
AnswerB.
A Binary Heap maintains sorted order, while a BST does not.
C.
A BST is always balanced, while a Binary Heap is not.
D.
A Binary Heap allows duplicate elements, while a BST does not.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board