Q32
What is the main reason for implementing a Binary Search Tree (BST) as a self-balancing tree?
A.
To maintain O(log n) time complexity for insertions, deletions, and searches.
AnswerB.
To ensure the tree is always a complete binary tree.
C.
To allow nodes to be stored in any order.
D.
To minimize memory usage.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board