项目描述 ：
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.

高级语言： C

项目主页：

项目地址: git://github.com/Myrto-Iglezou/Red-Black-Tree.git

创建时间： 2020-02-29T13:20:02Z
项目社区：https://github.com/Myrto-Iglezou/Red-Black-Tree
开源协议：
下载