In a Red-Black Tree, if an internal black node is of degree 1, t

In a Red-Black Tree, if an internal black node is of degree 1, then it has only 1 descendant node.~@[](2)

答案：TRUE