Advanced Data Structures | Red-Black Tree [01] Introduction | شرح بالعربي

Red-Black Tree ( Part 1) introduction properties proof ============================== Download Materials : https://github.com/Abdalla2030/Educat... ============================== Red-Black tree is a self-balancing binary search tree in which each node contains an extra bit for denoting the color of the node, either red or black. A red-black tree satisfies the following properties: Red/Black Property: Every node is colored, either red or black. Root Property: The root is black. Leaf Property: Every leaf (NIL) is black. Red Property: If a red node has children then, the children are always black. Depth Property: For each node, any simple path from this node to any of its descendant leaf has the same black-depth (the number of black nodes).