Q37
What is the main advantage of using a Red-Black Tree over a regular binary search tree?
A.
It guarantees O(log n) time complexity for insertion, deletion, and search operations.
AnswerB.
It uses less memory compared to a regular BST.
C.
It allows duplicate keys to be stored.
D.
It automatically sorts elements.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board