[FEATURE] Add Red-Black Tree implementation #1536
Description
Detailed description
Add a Red-Black Tree data structure implementation to the data_structures folder. This self-balancing BST provides O(log n) time complexity for insertions, deletions, and lookups.
Context
Red-Black Trees are fundamental data structures used in many standard libraries. Adding this would help students understand self-balancing trees and benefit competitive programmers.
Possible implementation
No response
Additional information
No response