Q14
What is the main advantage of using a Binary Search Tree (BST) over an unsorted list?
A.
It allows for faster search, insertion, and deletion operations.
AnswerB.
It uses less memory.
C.
It is easier to implement.
D.
It maintains elements in sorted order.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board