Q5
Which of the following operations can be performed in O(log n) time on a balanced Binary Search Tree?
A.
Insertion
B.
Deletion
C.
Search
D.
All of the above
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board