[PR #282] [MERGED] Adding Code for Red Black Tree #586

New Issue

claunia · 2026-01-29T15:13:58Z

claunia commented

2026-01-29 15:13:58 +00:00

📋 Pull Request Information

Original PR: https://github.com/TheAlgorithms/C/pull/282
Author: @Abhijitpatil19
Created: 10/1/2019
Status: ✅ Merged
Merged: 10/1/2019
Merged by: @StepfenShawn

Base: master ← Head: master

📝 Commits (1)

af05811 Create redBlackTree.c

📊 Changes

1 file changed (+678 additions, -0 deletions)

View changed files

➕ data_structures/binary_trees/redBlackTree.c (+678 -0)

📄 Description

✨ This is a C Program that implements Red Black Trees. It contains functions for Insertion, Deletion, and Inorder Traversal.

_{🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.}

## 📋 Pull Request Information **Original PR:** https://github.com/TheAlgorithms/C/pull/282 **Author:** [@Abhijitpatil19](https://github.com/Abhijitpatil19) **Created:** 10/1/2019 **Status:** ✅ Merged **Merged:** 10/1/2019 **Merged by:** [@StepfenShawn](https://github.com/StepfenShawn) **Base:** `master` ← **Head:** `master` --- ### 📝 Commits (1) - [`af05811`](https://github.com/TheAlgorithms/C/commit/af0581193f9e98f0192465c535a6ed89b97ed070) Create redBlackTree.c ### 📊 Changes **1 file changed** (+678 additions, -0 deletions) <details> <summary>View changed files</summary> ➕ `data_structures/binary_trees/redBlackTree.c` (+678 -0) </details> ### 📄 Description :sparkles: This is a C Program that implements Red Black Trees. It contains functions for Insertion, Deletion, and Inorder Traversal. --- <sub>🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.</sub>

claunia added the pull-request label 2026-01-29 15:13:58 +00:00

claunia closed this issue

2026-01-29 15:13:59 +00:00

claunia referenced this issue

2026-01-29 15:16:53 +00:00

[PR #586] [MERGED] Convert integer to string #1020

claunia referenced this issue

2026-01-29 15:16:54 +00:00

[PR #586] Convert integer to string #1024

Sign in to join this conversation.