The question is intended as a self-test for readers. Answers may be found in Appendix C.
Which of the following is not a red-black rule?
a. Every path from a root to a leaf, or to a null child, must contain the same number of black nodes
b. If a node is black, its children must be red
c. The root is always black
d. All three are valid rules
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.