红黑树删除
情形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
- Double black node has black sibling,is a right child,and its left nephew is red.One rotation can fix double-blackness
- Single rotation Right