Hi can someone please answer this httpwwwcheggcomhomeworkhe

Hi, can someone please answer this? : http://www.chegg.com/homework-help/Algorithms-4th-edition-chapter-3.3-problem-9E-solution-9780321573513

Solution

A red-black tree is a binary search tree in which every node has a colour red or black connected with it as well to its key and left and right children

The subsequent 3 properties grasp:

Root property - The root of the red-black tree be black

Red property - The children of a red node be black.

Black property - For every node with at least single null child, the number of black nodes on the path as of the root to the null child is the similar.