红黑树删除
情形1 Node to delete has two children.Find the largest node in left subtree Copy largest value of left subtree into node to delete Remove node whose value was copied Coloring child of deleted node black
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。