🎋 Visualize what happens to a red-black tree when nodes are inserted and removed

non-recursive left-leaning red-black tree in C++

A red–black tree is a self-balancing binary search tree. Each node of the binary tree has an extra bit, and that bit is interpreted as the color (red or black) of the node. These color bits are used to ensure the tree remains balanced during insertions and deletions.

rbtree implementation in c

Red-Black tree (WIP)

MyMediaJam is a web application to provide faster searching using hierarchical RB Trees. It creates indexes in form of RB tree's nodes for music,images and videos for now that allows us to search them in local computer very very fast using BFS algorithm. The application is developed on Java's MVC Struts framework and back end is been done using …

红黑树原理解析（思路来自美团技术团队）

Package rbtree implements a red–black tree.

SW Jungle 4th Project Red-Black Tree Implement

eden project

An implementation of the standard functions for red-black trees in C

High Performance Light Weight Web Server

Data structure implementation

Implementing some Trees and its functions

Red/Black tree on-disk implementation with go

2ª Lista de exercícios relativa a disciplina de Análise de Algoritmos 2016.1 do curso de Ciência da Computação da Universidade Federal de Roraima

MIT 6.824-2018 Labs

Лабораторная работа по дисциплине "Практикум по программированию"