Which of the following statement(s) is/are correct about red-black binary tree?
Which of the following statement(s) is/are correct about red-black binary tree?
I. Every node is either red or black.
II. Every leaf node is red.
III. When a node is red and both its children are black.
Show answerHide answer
Correct answer: (C) I and III
Explanation
In a red-black tree every node is red or black, and a red node's children must be black. Leaves (NIL nodes) are black, not red, so II is false.