Which of the following is a correct statement about red-black trees?
A)It is a balanced binary search tree that rebalances itself after each insertion or removal.
B)The root is red.
C)All child nodes of a black node must be red.
D)All paths from root to null have the name number of red nodes.

Question

Quizplus · Accepted Answer

Red-black trees are balanced binary search trees that automatically rebalance themselves after each insertion or removal operation. The other statements listed are not accurate. The root can be either red or black (though conventionally it is black), child nodes of a black node can be either red or black, and the number of black nodes on a path from root to leaf can vary.

Which of the Following Is a Correct Statement About Red-Black