mirror of
https://github.com/TheAlgorithms/C.git
synced 2026-02-16 21:52:38 +00:00
[FEATURE] Add Red-Black Tree implementation #204
Reference in New Issue
Block a user
Delete Branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Originally created by @Nihhaar0002 on GitHub (Nov 26, 2025).
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
@github-actions[bot] commented on GitHub (Dec 27, 2025):
This issue has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.
@github-actions[bot] commented on GitHub (Jan 4, 2026):
Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!