This program implements a Red-Black Tree, a self balancing binary search tree.
- Insert nodes with automatic balancing and coloring
- Delete nodes while maintaining tree properties
- Inorder traversal
- Insert keys interactively
- Print the tree structure
- Delete keys by value
The tree maintains balance by enforcing Red-Black properties via rotations and recoloring during insertions and deletions.