2-3 Trees

• DBMS(Database management System)

2-3-4 Trees

Red-Black Trees

1. its a height balanced binary search tree, similar to 2-3-4 tree
2. Every node is Red or Black
3. Root of a Tree is Black
4. Null is also Black
5. Number of Blacks on path from root to leaf are same
6. No 2 consecutive Red, Parent and children of Red are Black
7. New inserted Node is Red
8. Height in logn <= H<= 2logn

Red-Black Deletion