Red Black Tree in Data Structures

p {margin: 0; padding: 0;} Red- - Black Tree may Benary 01 search may not tree be height balanced red tree Colors are assigned to nodes, either or black + color of root is always black. The red node should not have red children. it should have black children The blacknorde number of blacknodes from - root to all noctos should be same. leaves B Here no of 2 014 blocknocles 2 in all cases. B I 5 R R NIL B 4 7 B B B NI L of R 3 6 9 (GH) R R 1 if a hode doesnot have child, then that no child is called 'NIL and its color is black. of de 0 OH trail] od