"Data Structure" red-black Tree

Red and black Tree purpose

Maintain the balance of binary lookup trees with specific actions when inserting and deleting operations, resulting in higher lookup performance.

Efficiency

Find, insert, and delete time complexity: O (log n), n is the number of elements in the tree.

Properties

• The nodes are red or black.
• The root node is black.
• Each leaf node (nil node, empty node) is black.
• The two child nodes of each red node are black. (no two consecutive red nodes can be found on all paths from each leaf to the root)
• All paths from any node to each of its leaves contain the same number of black nodes.

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

"Data Structure" red-black Tree