[prev] [index] [next]

Red-Black Tree Insertion (cont)

Splitting a 4-node, in a red-black tree:

[Diagram:Pics/trees/red-black-split.png]

Code: 

if (red(L(currTree)) && red(R(currTree))
{ 
   currTree->colour = RED; 
   currTree->left->colour = BLACK; 
   currTree->left->colour = BLACK; 
}