Red Black Tree

✅ Red Black Tree

self balancing BST
colors all nodes in red or black
to maintain balance during insertions, deletions

• root is always black
• maintains the connected nodes not to repeat color
  • red node has black children
  • every path from a node to its descendant null node has same number of black nodes

🆚 AVL tree

• AVL tree: more balanced
  
• Red Black Tree: more effective for insertion and deletions(less roatation)