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

Multiple Choice

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.