Implement Red-Black Tree

[FrancoSecchi]

Hello! I would like to contribute to this project for the first time as I'm new to open source.

I’d like to construct a Red-Black Tree data structure in the DataStructures directory, following the existing style and API conventions used in this repository.
Basic operations like insertion, delete, search, min max, and inorder are all part of the planned work. Unit tests to confirm insertion, deletion, and invariants; node rotations and color balancing to preserve Red-Black Tree characteristics. as well as usage-inspiring documentation.

I would like to get started on this and then submit a PR if there are no objections or ongoing implementations.

I appreciate your time and input 😄.

[Ravikant-1811]

Hi @FrancoSecchi 👋

I’ll take up this issue and start working on the Red-Black Tree implementation as described. I’ll follow the existing coding style and API conventions, include the required operations, unit tests, and documentation.

I’ll submit a Pull Request once the implementation is ready.

Thanks! 🚀