HarshCasper / NeoAlgo

Bringing all Data Structures and Algorithms under one Roof âš¡
MIT License
875 stars 1.05k forks source link

Red Black Tree implementation in C language #7605

Closed ksananth4424 closed 8 months ago

ksananth4424 commented 10 months ago

🚀 RED - BLACK tree implementation in C

This code is a clear implementation of RED - BLACK tree in C language where in insert, delete, search and printing tree level by level features are implemented.

Have you read the Contributing Guidelines on Pull Requests?

Yes.

Motivation

One of the reasons is to use my code into good use where in I could contribute to open source. The other reason being Hactoberfest. So, I do request to assign this under Hactoberfest tag.

Pitch

This implementaion of the RED - BLACK tree is a perfect implementation, as it takes inspiration from the well known textbook Introduction to Algorithms (CLRS).

Thank you Happy Coding!

github-actions[bot] commented 10 months ago

Hello @ksananth4424,
Thank you for opening an issue. :partying_face:
To get assigned to this particular issue please use /assign
Check this guide before contributing.

ksananth4424 commented 10 months ago

🚀 RED - BLACK tree implementation in C

This code is a clear implementation of RED - BLACK tree in C language where in insert, delete, search and printing tree level by level features are implemented.

Have you read the Contributing Guidelines on Pull Requests?

Yes.

Motivation

One of the reasons is to use my code into good use where in I could contribute to open source. The other reason being Hactoberfest. So, I do request to assign this under Hactoberfest tag.

Pitch

This implementaion of the RED - BLACK tree is a perfect implementation, as it takes inspiration from the well known textbook Introduction to Algorithms (CLRS).

Thank you Happy Coding!

/assign

github-actions[bot] commented 8 months ago

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Telegram or ping one of the reviewers. Thank you for your contributions!