Question
Which data structure or concept is best described as a self-balancing binary search tree that uses node colors and structural rules?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Red-Black Tree
Explanation:
Red-Black Tree is a self-balancing binary search tree that uses node colors and structural rules.
This description distinguishes it from the other choices.
Leave a Reply