（是非題）Since the leaf nodes of a red-black (RB) tree are all black nodes, when we insert a new data to a RB tree, we first insert this new data to the RB tree like a regular binary search tree operation (i.e. push it to the leaf), paint the corresponding new leaf node red, and then perform rotation(s) to balance the RB tree, if necessary.