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 must have only 1 descendant node. ~@[](2)

答案：TRUE