Data Structures and Algorithms in Swift by Elshad Karimov

Author:Elshad Karimov
Language: eng
Format: epub
ISBN: 9781484257692
Publisher: Apress

The root node is always black.

Nil leaves are always black.

If a node is red node, the children must be black.

For each node, all simple paths from the node to the descendant leaves contain the same number of black.

Figure 12-1Example of a red–black tree

Figure 12-1 shows the basic structure of red–black trees.

A Red–black tree is a self-balancing tree – the limitations put on the node colors ensure that any simple path from the root to a leaf is not more than twice as long as any other such path. It helps in maintaining the self-balancing property of the red–black tree.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.