Data Structures | Balanced Binary Search Trees | Question 9
Which of the following is true about Red Black Trees?
(A) The path from the root to the furthest leaf is no more than twice as long as the path from the root to the nearest leaf
(B) At least one children of every black node is red
(C) Root may be red
(D) A leaf node may be red
Explanation: See http://en.wikipedia.org/wiki/Red%E2%80%93black_tree
Quiz of this Question