Q192
What are the operations that could be performed in O(logn) time complexity by red-black tree?
A.
insertion, deletion, finding predecessor, successor
AnswerB.
only insertion
C.
only finding predecessor, successor
D.
for sorting
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board