Q31
Which data structure is used for implementing a self-balancing tree with O(log n) operations?
A.
Queue
B.
Stack
C.
Red-Black Tree
AnswerD.
Hash Table
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board