red-black tree
323
red-black tree
A red-black tree is a self-balancing binary search tree that maintains an additional bit of color information (red or black) at each node. The color of the nodes is used to ensure that the tree remains balanced, resulting in a near-perfect balance between search time and insert/delete time.
