红黑树Tree-insert

本文描述的将节点z按二叉搜索树插入红黑树T后，如何维持红黑树性质

Tree-insert（T, z），T是红黑树，z是新插入节点，初始z.color = red，按二叉搜索树将z插入到T中后，

ps： 以下树节点中仅展示内部节点（黑色的叶节点NIL未展示）

目录

1、z.p is null

2、z.p.color == black

3、z.p.color  == red

3.1  z.p  == z.p.p.left

3.1.1  z.p.p.right.color = red

3.1.2  z.p.p.right.color = black && z == z.p.left

3.1.3  z.p.p.right.color = black && z == z.p.right

3.2  z.p  == z.p.p.right

3.2.1  z.p.p.left.color = red

3.2.2  z.p.p.left.color = black && z == z.p.left

3.2.3  z.p.p.left.color = black && z == z.p.right

---

---

1、z.p is null

T.root.color = black

   

2、z.p.color == black

   无需做任何操作

  

3、z.p.color  == red

3.1  z.p  == z.p.p.left

3.1.1  z.p.p.right.color = red

z.p.color = black
z.p.p.right.color = black
z.p.p.color = red
z = z.p.p