Red/black tree

Binary Search tree with the following features: (the depth of the red/black tree can be ensured to be logarithm-level, and its depth is usually the same as that of the AVL Tree)

1. Each node is marked as red or black.

2. The root is black.

3. If a node is red, its child is black (continuous red nodes are not allowed)

4. Each path from a node to a null chain must contain the same number of black nodes.

Bottom-up insert:

1: (1) the new node must be painted in red.

1) The father of the new node is black and the operation is complete.

2) The father is red and needs to change the color and rotate the tree:

The father's brother node is black, and X is an external grandson.

 

X is the internal grandson

 

 

Red/black tree