Updated_redblacktree.c_file

[akshithagunupati]

#1373

Description of Change

This repository features a C implementation of a Red-Black Tree, which is a self-balancing binary search tree. Notably, the pull request addresses a rectification in the return statement of the newNode function, ensuring accurate memory allocation and node creation. I have tested the code, and it is working correctly.

References

Checklist

• Added description of change
• Added file name matches File name guidelines
• Added tests and example, test must pass
• Relevant documentation/comments is changed or added
• PR title follows semantic commit guidelines
• Search previous suggestions before making a new one, as yours may be a duplicate.
• I acknowledge that all my contributions will be made under the project's license.

Notes:

[realstealthninja]

Very well done on spotting that

[akshithagunupati]

Thank you @realstealthninja for the approval.
@Panquesito7 @tjgurwara99 @alexpantyukhin could you please look in to the code change and let me know if anything needs to be added?

[github-actions]

This pull request 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]

Please ping one of the maintainers once you commit the changes requested or make improvements on the code. 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!