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.
B. 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
This Question Belongs to Data Structure >> Trees In Data Structures
Join The Discussion