Q13
How can you balance a Binary Search Tree to ensure O(log n) time complexity for operations?
A.
By using self-balancing trees like AVL Trees or Red-Black Trees.
AnswerB.
By reordering elements after each operation.
C.
By increasing the size of the tree.
D.
By ensuring all nodes have two children.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board