[prev] [index] [next]

Red-Black Tree Insertion (cont)

Checking subtree after insertion, e.g.
  • two successive red links = newly-created 4-node

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

Code: 

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