red-black tree is a binary search tree that is balanced by coloring nodes red or black by some rules. (insertion and deletion video links are in the description below the video.)
concept of balanced binary search tree and how to rotate for balancing the tree. balanced binary search tree is a binary search tree that lets the search cost always O(log n) by making it balanced (not skewed).
1
Red-Black Trees - Data Structures
AVL tree removals
Balanced binary search tree rotations
