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.

Yet another red-black tree implementation

Implementation of an undistributed information processing tool that receives, processes, records and answers questions about viruses. It is created, using system calls fork / exec, threads, signals and communication through pipes, using low-level I / O and sockets.

Implementation of an undistributed information processing tool that receives, processes, records and answers questions about viruses. It is created with processes, using system calls fork / exec and communicating processes through pipes, using low-level I / O.

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

A C program that makes RedBlack trees and Binary search trees.