Q25
In which scenario is a Binary Search Tree (BST) not suitable?
A.
When the data is not sorted.
AnswerB.
When frequent insertions and deletions are needed.
C.
When the tree must be balanced at all times.
D.
When elements need to be stored in a priority order.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board