Q39
What happens if a Binary Search Tree (BST) becomes unbalanced due to insertions or deletions?
A.
Search, insertion, and deletion operations may degrade to O(n) time complexity.
AnswerB.
The tree automatically rebalances itself.
C.
The tree converts into a binary heap.
D.
The tree becomes a complete binary tree.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board