Red black tree insertion
- 2. RED BLACK TREE Red Black Tree is a Binary Search Tree in which every node is colored either RED or BLACK. In a Red Black Tree the color of a node is decided based on the Red Black Tree properties.
- 3. PROPERTIES OF RED BLACK TREE Every node is either red or black. The root is black. Every leaf (nil) is black. If a node is red, then both its children are black. For each node, all paths from the node to descendant leaves contain the same number of black nodes.
- 4. EXAMPLE
- 5. INSERTION INTO RED BLACK TREE In a Red Black Tree, every new node must be inserted with color RED. The insertion operation in Red Black Tree is similar to insertion operation in Binary Search Tree. But it is inserted with a color property. After every insertion operation, we need to check all the properties of Red Black Tree. If all the properties are satisfied then we go to next operation otherwise we need to perform following operation to make it Red Black Tree. 1. Recolor 2. Rotation followed by Recolor
- 6. RB TREE ROTATIONS There are two type of rotations: left rotation right rotation
- 7. The insertion operation in Red Black tree is performed using following steps... Step 1: Check whether tree is Empty. Step 2: If tree is Empty then insert the newNode as Root node with color Black and exit from the operation. step 3: If tree is not Empty then insert the newNode as a leaf node with Red color. Step 4: If the parent of newNode is Black then exit from the operation. Step 5: If the parent of newNode is Red then check the color of parent node's sibling of newNode. Step 6: If it is Black or NULL node then make a suitable Rotation and Recolor it. Step 7: If it is Red colored node then perform Recolor and Recheck it. Repeat the same until tree becomes Red Black Tree.
- 8. EXAMPLE
- 16. =>After Left Rotation & Recolor
- 17. THANK YOU