Intermediate
Data Structures & Algorithms
Q47 / 100
What is a Red-Black tree?
Correct! Well done.
Incorrect.
The correct answer is B) A self-balancing BST with color properties ensuring O(log n) height by limiting path length differences
B
Correct Answer
A self-balancing BST with color properties ensuring O(log n) height by limiting path length differences
Explanation
Red-Black trees maintain five invariants (root is black, red nodes have black children, equal black height on all paths) guaranteeing height ≤ 2 log(n+1).
Progress
47/100