Q42
What is the typical use case for a Binary Search Tree (BST) in computing?
A.
To implement dynamic sets and lookup tables.
AnswerB.
To perform sorting operations.
C.
To manage hierarchical data.
D.
To implement priority queues.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board